./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-1.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 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:24:07,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:24:07,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:24:07,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:24:07,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:24:07,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:24:07,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:24:07,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:24:07,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:24:07,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:24:07,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:24:07,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:24:07,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:24:07,889 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:24:07,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:07,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:24:07,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:24:07,890 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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2025-03-03 15:24:08,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:24:08,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:24:08,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:24:08,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:24:08,140 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:24:08,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2025-03-03 15:24:09,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3164eaff0/ce94a2d5da2c40dc910c808d865e90ac/FLAGf0f6b42a4 [2025-03-03 15:24:09,598 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:24:09,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2025-03-03 15:24:09,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3164eaff0/ce94a2d5da2c40dc910c808d865e90ac/FLAGf0f6b42a4 [2025-03-03 15:24:09,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3164eaff0/ce94a2d5da2c40dc910c808d865e90ac [2025-03-03 15:24:09,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:24:09,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:24:09,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:09,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:24:09,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:24:09,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:09" (1/1) ... [2025-03-03 15:24:09,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e5a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:09, skipping insertion in model container [2025-03-03 15:24:09,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:09" (1/1) ... [2025-03-03 15:24:09,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:24:09,886 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/seq-pthread/cs_stateful-1.i[23400,23413] [2025-03-03 15:24:09,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:09,970 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:24:09,999 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/seq-pthread/cs_stateful-1.i[23400,23413] [2025-03-03 15:24:10,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:10,082 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:24:10,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10 WrapperNode [2025-03-03 15:24:10,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:10,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:10,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:24:10,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:24:10,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,128 INFO L138 Inliner]: procedures = 144, calls = 240, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 572 [2025-03-03 15:24:10,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:10,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:24:10,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:24:10,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:24:10,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,172 INFO L175 MemorySlicer]: Split 120 memory accesses to 17 slices as follows [2, 8, 8, 8, 3, 20, 12, 0, 10, 10, 3, 7, 3, 12, 4, 3, 7]. 17 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 3, 3, 3, 0, 6, 6, 0, 2, 2, 0, 0, 0, 4, 0, 0, 0]. The 37 writes are split as follows [0, 2, 2, 2, 1, 8, 3, 0, 4, 4, 1, 1, 1, 4, 2, 1, 1]. [2025-03-03 15:24:10,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:24:10,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:24:10,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:24:10,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:24:10,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (1/1) ... [2025-03-03 15:24:10,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:10,239 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-03 15:24:10,241 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-03 15:24:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:24:10,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:24:10,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:24:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:24:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:24:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:24:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:24:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:24:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:24:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:24:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:24:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:24:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 15:24:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-03-03 15:24:10,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-03 15:24:10,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:24:10,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:24:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:24:10,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:10,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:24:10,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:24:10,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:24:10,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:24:10,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:24:10,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:24:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:24:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-03 15:24:10,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-03 15:24:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:24:10,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:24:10,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:24:10,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:24:10,824 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:10,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:11,153 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-03 15:24:11,153 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:24:11,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:24:11,161 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:24:11,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:11 BoogieIcfgContainer [2025-03-03 15:24:11,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:24:11,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:24:11,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:24:11,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:24:11,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:24:09" (1/3) ... [2025-03-03 15:24:11,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39de817d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:11, skipping insertion in model container [2025-03-03 15:24:11,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:10" (2/3) ... [2025-03-03 15:24:11,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39de817d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:11, skipping insertion in model container [2025-03-03 15:24:11,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:11" (3/3) ... [2025-03-03 15:24:11,172 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2025-03-03 15:24:11,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:24:11,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stateful-1.i that has 8 procedures, 165 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 15:24:11,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:24:11,229 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;@1f0de7de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:24:11,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:24:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 115 states have internal predecessors, (172), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 15:24:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 15:24:11,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:11,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:11,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1701091834, now seen corresponding path program 1 times [2025-03-03 15:24:11,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:11,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132613924] [2025-03-03 15:24:11,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:11,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:11,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 15:24:11,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 15:24:11,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:11,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:24:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132613924] [2025-03-03 15:24:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132613924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:11,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:11,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:11,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146953816] [2025-03-03 15:24:11,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:11,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:11,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:11,682 INFO L87 Difference]: Start difference. First operand has 165 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 115 states have internal predecessors, (172), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:11,851 INFO L93 Difference]: Finished difference Result 328 states and 540 transitions. [2025-03-03 15:24:11,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:11,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 15:24:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:11,861 INFO L225 Difference]: With dead ends: 328 [2025-03-03 15:24:11,861 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 15:24:11,866 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-03 15:24:11,872 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 2 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:11,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 477 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:24:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 15:24:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2025-03-03 15:24:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 15:24:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2025-03-03 15:24:11,925 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 31 [2025-03-03 15:24:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:11,926 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2025-03-03 15:24:11,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2025-03-03 15:24:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 15:24:11,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:11,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:11,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:24:11,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:11,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1927438962, now seen corresponding path program 1 times [2025-03-03 15:24:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293090872] [2025-03-03 15:24:11,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:11,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 15:24:12,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 15:24:12,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:12,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:24:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293090872] [2025-03-03 15:24:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293090872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:12,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:12,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851499737] [2025-03-03 15:24:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:12,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:12,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:12,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:12,121 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:12,168 INFO L93 Difference]: Finished difference Result 322 states and 479 transitions. [2025-03-03 15:24:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:12,172 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 15:24:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:12,174 INFO L225 Difference]: With dead ends: 322 [2025-03-03 15:24:12,177 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 15:24:12,178 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-03 15:24:12,179 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 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-03 15:24:12,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 15:24:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-03 15:24:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 113 states have internal predecessors, (157), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 15:24:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2025-03-03 15:24:12,200 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 33 [2025-03-03 15:24:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:12,203 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2025-03-03 15:24:12,203 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2025-03-03 15:24:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 15:24:12,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:12,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:12,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:24:12,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:12,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1357392983, now seen corresponding path program 1 times [2025-03-03 15:24:12,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:12,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371063465] [2025-03-03 15:24:12,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:12,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 15:24:12,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 15:24:12,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:24:12,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:12,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371063465] [2025-03-03 15:24:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371063465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:12,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151015529] [2025-03-03 15:24:12,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:12,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:12,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:12,379 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-03 15:24:12,380 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-03 15:24:12,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 15:24:12,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 15:24:12,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:12,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:12,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:24:12,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:24:12,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:24:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151015529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:12,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:24:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4923106] [2025-03-03 15:24:12,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:12,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:12,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:12,710 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:12,760 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2025-03-03 15:24:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:24:12,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-03 15:24:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:12,763 INFO L225 Difference]: With dead ends: 325 [2025-03-03 15:24:12,763 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 15:24:12,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:12,765 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:12,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 943 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 15:24:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-03 15:24:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.382608695652174) internal successors, (159), 115 states have internal predecessors, (159), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 15:24:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2025-03-03 15:24:12,783 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 34 [2025-03-03 15:24:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:12,783 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2025-03-03 15:24:12,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2025-03-03 15:24:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 15:24:12,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:12,786 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:24:12,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:24:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:12,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1487502409, now seen corresponding path program 2 times [2025-03-03 15:24:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701191922] [2025-03-03 15:24:12,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:13,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-03 15:24:13,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 36 statements. [2025-03-03 15:24:13,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:13,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:13,332 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-03 15:24:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701191922] [2025-03-03 15:24:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701191922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:13,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827063730] [2025-03-03 15:24:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:13,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:13,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:13,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:13,334 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:13,380 INFO L93 Difference]: Finished difference Result 320 states and 481 transitions. [2025-03-03 15:24:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 15:24:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:13,383 INFO L225 Difference]: With dead ends: 320 [2025-03-03 15:24:13,383 INFO L226 Difference]: Without dead ends: 294 [2025-03-03 15:24:13,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:13,386 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 202 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:13,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 861 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-03 15:24:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2025-03-03 15:24:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 195 states have (on average 1.4256410256410257) internal successors, (278), 195 states have internal predecessors, (278), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2025-03-03 15:24:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 452 transitions. [2025-03-03 15:24:13,416 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 452 transitions. Word has length 36 [2025-03-03 15:24:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:13,416 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 452 transitions. [2025-03-03 15:24:13,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:24:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 452 transitions. [2025-03-03 15:24:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:24:13,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:13,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:24:13,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:24:13,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:13,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash -506274810, now seen corresponding path program 1 times [2025-03-03 15:24:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:13,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50055327] [2025-03-03 15:24:13,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:13,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:24:13,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:24:13,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:13,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:24:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50055327] [2025-03-03 15:24:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50055327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528762252] [2025-03-03 15:24:13,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:13,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:13,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:13,645 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-03 15:24:13,646 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-03 15:24:13,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:24:13,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:24:13,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:13,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:13,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:24:13,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:24:13,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 15:24:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528762252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:14,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-03 15:24:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941617470] [2025-03-03 15:24:14,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:14,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:14,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:14,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:14,078 INFO L87 Difference]: Start difference. First operand 293 states and 452 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 15:24:15,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:15,302 INFO L93 Difference]: Finished difference Result 583 states and 901 transitions. [2025-03-03 15:24:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2025-03-03 15:24:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:15,304 INFO L225 Difference]: With dead ends: 583 [2025-03-03 15:24:15,304 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 15:24:15,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:15,308 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 2 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:15,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 470 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:24:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 15:24:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-03 15:24:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 200 states have (on average 1.42) internal successors, (284), 200 states have internal predecessors, (284), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2025-03-03 15:24:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 458 transitions. [2025-03-03 15:24:15,330 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 458 transitions. Word has length 86 [2025-03-03 15:24:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 458 transitions. [2025-03-03 15:24:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 15:24:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 458 transitions. [2025-03-03 15:24:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:24:15,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:15,348 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-03-03 15:24:15,356 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-03 15:24:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:15,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:15,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 587745631, now seen corresponding path program 2 times [2025-03-03 15:24:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:15,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233498643] [2025-03-03 15:24:15,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:15,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-03 15:24:15,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 91 statements. [2025-03-03 15:24:15,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:15,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 15:24:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233498643] [2025-03-03 15:24:15,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233498643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:15,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:15,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951733763] [2025-03-03 15:24:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:15,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:15,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:15,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:15,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:15,864 INFO L87 Difference]: Start difference. First operand 298 states and 458 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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-03 15:24:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:16,891 INFO L93 Difference]: Finished difference Result 619 states and 952 transitions. [2025-03-03 15:24:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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 91 [2025-03-03 15:24:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:16,896 INFO L225 Difference]: With dead ends: 619 [2025-03-03 15:24:16,897 INFO L226 Difference]: Without dead ends: 593 [2025-03-03 15:24:16,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:16,899 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 273 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:16,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 857 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:24:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-03 15:24:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 564. [2025-03-03 15:24:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 367 states have (on average 1.444141689373297) internal successors, (530), 370 states have internal predecessors, (530), 165 states have call successors, (165), 28 states have call predecessors, (165), 31 states have return successors, (197), 165 states have call predecessors, (197), 165 states have call successors, (197) [2025-03-03 15:24:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 892 transitions. [2025-03-03 15:24:16,949 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 892 transitions. Word has length 91 [2025-03-03 15:24:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:16,949 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 892 transitions. [2025-03-03 15:24:16,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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-03 15:24:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 892 transitions. [2025-03-03 15:24:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:24:16,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:16,952 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-03-03 15:24:16,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:24:16,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:16,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash -766681061, now seen corresponding path program 1 times [2025-03-03 15:24:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:16,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917047563] [2025-03-03 15:24:16,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:16,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:16,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:24:17,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:24:17,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:17,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 15:24:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:17,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917047563] [2025-03-03 15:24:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917047563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972921638] [2025-03-03 15:24:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:17,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:17,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:17,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:17,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:17,327 INFO L87 Difference]: Start difference. First operand 564 states and 892 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:24:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:18,434 INFO L93 Difference]: Finished difference Result 941 states and 1451 transitions. [2025-03-03 15:24:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-03-03 15:24:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:18,440 INFO L225 Difference]: With dead ends: 941 [2025-03-03 15:24:18,440 INFO L226 Difference]: Without dead ends: 582 [2025-03-03 15:24:18,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:18,442 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 223 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:18,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 788 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:24:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-03 15:24:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 555. [2025-03-03 15:24:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 361 states have (on average 1.443213296398892) internal successors, (521), 362 states have internal predecessors, (521), 163 states have call successors, (163), 28 states have call predecessors, (163), 30 states have return successors, (191), 164 states have call predecessors, (191), 163 states have call successors, (191) [2025-03-03 15:24:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 875 transitions. [2025-03-03 15:24:18,491 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 875 transitions. Word has length 91 [2025-03-03 15:24:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:18,491 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 875 transitions. [2025-03-03 15:24:18,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:24:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 875 transitions. [2025-03-03 15:24:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:24:18,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:18,493 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-03-03 15:24:18,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:24:18,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:18,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1518546113, now seen corresponding path program 1 times [2025-03-03 15:24:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103837988] [2025-03-03 15:24:18,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:18,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:24:18,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:24:18,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:18,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 15:24:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103837988] [2025-03-03 15:24:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103837988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284181002] [2025-03-03 15:24:18,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:18,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:18,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:18,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:18,877 INFO L87 Difference]: Start difference. First operand 555 states and 875 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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-03 15:24:19,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:21,089 INFO L93 Difference]: Finished difference Result 868 states and 1337 transitions. [2025-03-03 15:24:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:21,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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 91 [2025-03-03 15:24:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:21,093 INFO L225 Difference]: With dead ends: 868 [2025-03-03 15:24:21,094 INFO L226 Difference]: Without dead ends: 546 [2025-03-03 15:24:21,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:21,096 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 269 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:21,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 861 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 15:24:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-03 15:24:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 519. [2025-03-03 15:24:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 343 states have (on average 1.4285714285714286) internal successors, (490), 343 states have internal predecessors, (490), 146 states have call successors, (146), 26 states have call predecessors, (146), 29 states have return successors, (170), 149 states have call predecessors, (170), 146 states have call successors, (170) [2025-03-03 15:24:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 806 transitions. [2025-03-03 15:24:21,137 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 806 transitions. Word has length 91 [2025-03-03 15:24:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:21,137 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 806 transitions. [2025-03-03 15:24:21,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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-03 15:24:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 806 transitions. [2025-03-03 15:24:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:24:21,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:21,139 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-03-03 15:24:21,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:24:21,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1747506437, now seen corresponding path program 1 times [2025-03-03 15:24:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015679485] [2025-03-03 15:24:21,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:21,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:24:21,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:24:21,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:21,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 15:24:21,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015679485] [2025-03-03 15:24:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015679485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736173905] [2025-03-03 15:24:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:21,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:21,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:21,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:21,464 INFO L87 Difference]: Start difference. First operand 519 states and 806 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:24:22,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:24,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:24,275 INFO L93 Difference]: Finished difference Result 833 states and 1257 transitions. [2025-03-03 15:24:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-03-03 15:24:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:24,280 INFO L225 Difference]: With dead ends: 833 [2025-03-03 15:24:24,281 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 15:24:24,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:24,284 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 219 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:24,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 789 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 15:24:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 15:24:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 482. [2025-03-03 15:24:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 318 states have (on average 1.3584905660377358) internal successors, (432), 318 states have internal predecessors, (432), 136 states have call successors, (136), 25 states have call predecessors, (136), 27 states have return successors, (156), 138 states have call predecessors, (156), 136 states have call successors, (156) [2025-03-03 15:24:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 724 transitions. [2025-03-03 15:24:24,321 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 724 transitions. Word has length 91 [2025-03-03 15:24:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:24,321 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 724 transitions. [2025-03-03 15:24:24,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:24:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 724 transitions. [2025-03-03 15:24:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:24:24,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:24,324 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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] [2025-03-03 15:24:24,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:24:24,324 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:24,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash -108194529, now seen corresponding path program 1 times [2025-03-03 15:24:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:24,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85455217] [2025-03-03 15:24:24,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:24,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:24:24,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:24:24,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:24,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 15:24:24,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85455217] [2025-03-03 15:24:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85455217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:24,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:24,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569069964] [2025-03-03 15:24:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:24,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:24,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:24,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:24,775 INFO L87 Difference]: Start difference. First operand 482 states and 724 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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-03 15:24:27,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:28,063 INFO L93 Difference]: Finished difference Result 545 states and 789 transitions. [2025-03-03 15:24:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:24:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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 91 [2025-03-03 15:24:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:28,066 INFO L225 Difference]: With dead ends: 545 [2025-03-03 15:24:28,067 INFO L226 Difference]: Without dead ends: 429 [2025-03-03 15:24:28,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:28,068 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 243 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:28,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 937 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 15:24:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-03 15:24:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 399. [2025-03-03 15:24:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 271 states have (on average 1.3690036900369005) internal successors, (371), 271 states have internal predecessors, (371), 104 states have call successors, (104), 21 states have call predecessors, (104), 23 states have return successors, (122), 106 states have call predecessors, (122), 104 states have call successors, (122) [2025-03-03 15:24:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 597 transitions. [2025-03-03 15:24:28,091 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 597 transitions. Word has length 91 [2025-03-03 15:24:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:28,091 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 597 transitions. [2025-03-03 15:24:28,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 1 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-03 15:24:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 597 transitions. [2025-03-03 15:24:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:24:28,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:28,095 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 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, 1] [2025-03-03 15:24:28,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:24:28,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:28,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash -797545642, now seen corresponding path program 1 times [2025-03-03 15:24:28,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:28,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869796873] [2025-03-03 15:24:28,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:28,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:28,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:24:28,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:24:28,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:28,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-03 15:24:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:28,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869796873] [2025-03-03 15:24:28,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869796873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:28,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207404138] [2025-03-03 15:24:28,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:28,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:28,479 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-03 15:24:28,481 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-03 15:24:28,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:24:28,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:24:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:28,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:28,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:24:28,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-03 15:24:29,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-03 15:24:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207404138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:29,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-03 15:24:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494145278] [2025-03-03 15:24:29,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:29,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:24:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:29,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:24:29,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:24:29,328 INFO L87 Difference]: Start difference. First operand 399 states and 597 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2025-03-03 15:24:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:30,776 INFO L93 Difference]: Finished difference Result 1019 states and 1555 transitions. [2025-03-03 15:24:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:24:30,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 134 [2025-03-03 15:24:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:30,781 INFO L225 Difference]: With dead ends: 1019 [2025-03-03 15:24:30,781 INFO L226 Difference]: Without dead ends: 655 [2025-03-03 15:24:30,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:24:30,783 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 571 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:30,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 910 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:24:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-03 15:24:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 616. [2025-03-03 15:24:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 403 states have (on average 1.3945409429280398) internal successors, (562), 406 states have internal predecessors, (562), 174 states have call successors, (174), 36 states have call predecessors, (174), 38 states have return successors, (206), 173 states have call predecessors, (206), 174 states have call successors, (206) [2025-03-03 15:24:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 942 transitions. [2025-03-03 15:24:30,828 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 942 transitions. Word has length 134 [2025-03-03 15:24:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:30,828 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 942 transitions. [2025-03-03 15:24:30,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 7 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2025-03-03 15:24:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 942 transitions. [2025-03-03 15:24:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 15:24:30,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:30,831 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 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, 1] [2025-03-03 15:24:30,843 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-03 15:24:31,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:31,032 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:31,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1923137898, now seen corresponding path program 1 times [2025-03-03 15:24:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370899005] [2025-03-03 15:24:31,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:31,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:31,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:24:31,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:24:31,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:31,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-03 15:24:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370899005] [2025-03-03 15:24:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370899005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433155841] [2025-03-03 15:24:32,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:32,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:32,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:32,346 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-03 15:24:32,348 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-03 15:24:32,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 15:24:32,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 15:24:32,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:32,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:32,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 15:24:32,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:33,046 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 13 treesize of output 9 [2025-03-03 15:24:38,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 15:24:38,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:24:38,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-03 15:24:39,973 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-03 15:24:39,973 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 6 case distinctions, treesize of input 49 treesize of output 104 [2025-03-03 15:25:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 15:25:05,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:05,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-03-03 15:25:05,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-03 15:25:05,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-03 15:25:05,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-03 15:25:05,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-03 15:25:05,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-03 15:25:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-03 15:25:06,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433155841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:06,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-03-03 15:25:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465234696] [2025-03-03 15:25:06,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:06,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 15:25:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:06,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 15:25:06,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1258, Unknown=4, NotChecked=0, Total=1406 [2025-03-03 15:25:06,056 INFO L87 Difference]: Start difference. First operand 616 states and 942 transitions. Second operand has 38 states, 35 states have (on average 4.4) internal successors, (154), 36 states have internal predecessors, (154), 14 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) [2025-03-03 15:25:10,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:14,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:18,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:22,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:26,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:32,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:37,123 INFO L93 Difference]: Finished difference Result 1214 states and 1902 transitions. [2025-03-03 15:25:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 15:25:37,123 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.4) internal successors, (154), 36 states have internal predecessors, (154), 14 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) Word has length 134 [2025-03-03 15:25:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:37,127 INFO L225 Difference]: With dead ends: 1214 [2025-03-03 15:25:37,128 INFO L226 Difference]: Without dead ends: 714 [2025-03-03 15:25:37,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=677, Invalid=3609, Unknown=4, NotChecked=0, Total=4290 [2025-03-03 15:25:37,130 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1506 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 3422 mSolverCounterSat, 1103 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 2984 SdHoareTripleChecker+Invalid, 4531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1103 IncrementalHoareTripleChecker+Valid, 3422 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:37,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 2984 Invalid, 4531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1103 Valid, 3422 Invalid, 6 Unknown, 0 Unchecked, 29.7s Time] [2025-03-03 15:25:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-03 15:25:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 665. [2025-03-03 15:25:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 433 states have (on average 1.3926096997690531) internal successors, (603), 439 states have internal predecessors, (603), 188 states have call successors, (188), 36 states have call predecessors, (188), 43 states have return successors, (245), 189 states have call predecessors, (245), 188 states have call successors, (245) [2025-03-03 15:25:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1036 transitions. [2025-03-03 15:25:37,183 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1036 transitions. Word has length 134 [2025-03-03 15:25:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:37,183 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1036 transitions. [2025-03-03 15:25:37,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.4) internal successors, (154), 36 states have internal predecessors, (154), 14 states have call successors, (42), 11 states have call predecessors, (42), 13 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) [2025-03-03 15:25:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1036 transitions. [2025-03-03 15:25:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 15:25:37,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:37,186 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 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, 1, 1] [2025-03-03 15:25:37,196 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-03 15:25:37,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:37,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:37,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash -368802828, now seen corresponding path program 1 times [2025-03-03 15:25:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663376561] [2025-03-03 15:25:37,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:37,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 15:25:37,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 15:25:37,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:37,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-03 15:25:39,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:39,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663376561] [2025-03-03 15:25:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663376561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:39,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681927130] [2025-03-03 15:25:39,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:39,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:39,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:39,187 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-03 15:25:39,189 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-03 15:25:39,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 15:25:39,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 15:25:39,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:39,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:39,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 15:25:39,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:39,851 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 23 treesize of output 1