./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-01-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:06:07,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:06:07,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:06:07,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:06:07,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:06:07,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:06:07,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:06:07,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:06:07,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:06:07,696 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:06:07,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:06:07,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:06:07,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:06:07,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:06:07,696 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:06:07,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:06:07,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:06:07,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:06:07,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:06:07,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:06:07,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:06:07,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:06:07,698 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-jdk21/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 -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2025-02-07 20:06:07,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:06:07,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:06:07,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:06:07,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:06:07,904 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:06:07,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2025-02-07 20:06:09,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf68f9e9/c19bb153fb174b6e88b48edf81cff18f/FLAGd43f6e899 [2025-02-07 20:06:09,494 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:06:09,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2025-02-07 20:06:09,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf68f9e9/c19bb153fb174b6e88b48edf81cff18f/FLAGd43f6e899 [2025-02-07 20:06:09,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf68f9e9/c19bb153fb174b6e88b48edf81cff18f [2025-02-07 20:06:09,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:06:09,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:06:09,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:06:09,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:06:09,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:06:09,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:06:09" (1/1) ... [2025-02-07 20:06:09,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f79748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:09, skipping insertion in model container [2025-02-07 20:06:09,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:06:09" (1/1) ... [2025-02-07 20:06:09,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:06:10,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2025-02-07 20:06:10,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2025-02-07 20:06:10,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2025-02-07 20:06:10,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2025-02-07 20:06:10,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2025-02-07 20:06:10,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2025-02-07 20:06:10,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2025-02-07 20:06:10,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2025-02-07 20:06:10,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2025-02-07 20:06:10,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2025-02-07 20:06:10,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2025-02-07 20:06:10,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2025-02-07 20:06:10,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2025-02-07 20:06:10,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:06:10,063 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:06:10,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2025-02-07 20:06:10,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2025-02-07 20:06:10,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2025-02-07 20:06:10,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2025-02-07 20:06:10,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2025-02-07 20:06:10,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2025-02-07 20:06:10,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2025-02-07 20:06:10,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2025-02-07 20:06:10,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2025-02-07 20:06:10,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2025-02-07 20:06:10,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2025-02-07 20:06:10,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2025-02-07 20:06:10,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2025-02-07 20:06:10,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:06:10,131 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:06:10,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10 WrapperNode [2025-02-07 20:06:10,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:06:10,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:06:10,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:06:10,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:06:10,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,171 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 205 [2025-02-07 20:06:10,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:06:10,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:06:10,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:06:10,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:06:10,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,218 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2025-02-07 20:06:10,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:06:10,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:06:10,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:06:10,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:06:10,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (1/1) ... [2025-02-07 20:06:10,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:06:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:10,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:06:10,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:06:10,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:06:10,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:06:10,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:06:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:06:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:06:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:06:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:06:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:06:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:06:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:06:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:06:10,405 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:06:10,406 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:06:10,624 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-07 20:06:10,627 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:06:10,638 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:06:10,638 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:06:10,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:06:10 BoogieIcfgContainer [2025-02-07 20:06:10,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:06:10,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:06:10,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:06:10,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:06:10,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:06:09" (1/3) ... [2025-02-07 20:06:10,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47842f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:06:10, skipping insertion in model container [2025-02-07 20:06:10,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:06:10" (2/3) ... [2025-02-07 20:06:10,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47842f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:06:10, skipping insertion in model container [2025-02-07 20:06:10,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:06:10" (3/3) ... [2025-02-07 20:06:10,645 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2025-02-07 20:06:10,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:06:10,656 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-01-1.i that has 1 procedures, 87 locations, 1 initial locations, 17 loop locations, and 13 error locations. [2025-02-07 20:06:10,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:06:10,707 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;@48847b64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:06:10,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-07 20:06:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.8630136986301369) internal successors, (136), 86 states have internal predecessors, (136), 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-02-07 20:06:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 20:06:10,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:10,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 20:06:10,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:10,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash 5108094, now seen corresponding path program 1 times [2025-02-07 20:06:10,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:10,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202515635] [2025-02-07 20:06:10,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:10,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 20:06:10,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 20:06:10,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:10,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:10,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:10,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202515635] [2025-02-07 20:06:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202515635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:10,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:10,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:06:10,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775811609] [2025-02-07 20:06:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:10,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:06:10,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:10,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:06:10,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:06:10,877 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.8630136986301369) internal successors, (136), 86 states have internal predecessors, (136), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-02-07 20:06:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:10,923 INFO L93 Difference]: Finished difference Result 190 states and 299 transitions. [2025-02-07 20:06:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:06:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-07 20:06:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:10,930 INFO L225 Difference]: With dead ends: 190 [2025-02-07 20:06:10,930 INFO L226 Difference]: Without dead ends: 102 [2025-02-07 20:06:10,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-07 20:06:10,934 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 89 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:10,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:06:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-07 20:06:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2025-02-07 20:06:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.295774647887324) internal successors, (92), 82 states have internal predecessors, (92), 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-02-07 20:06:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2025-02-07 20:06:10,959 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 4 [2025-02-07 20:06:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:10,959 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2025-02-07 20:06:10,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-02-07 20:06:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2025-02-07 20:06:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:06:10,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:10,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:10,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:06:10,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:10,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2005778678, now seen corresponding path program 1 times [2025-02-07 20:06:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413779528] [2025-02-07 20:06:10,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:10,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:06:10,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:06:10,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:10,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413779528] [2025-02-07 20:06:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413779528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:06:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095018031] [2025-02-07 20:06:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:11,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:06:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:11,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:06:11,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:06:11,142 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-07 20:06:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:11,206 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-02-07 20:06:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:06:11,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-02-07 20:06:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:11,207 INFO L225 Difference]: With dead ends: 84 [2025-02-07 20:06:11,207 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 20:06:11,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:06:11,208 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:11,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:06:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 20:06:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-07 20:06:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 80 states have internal predecessors, (90), 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-02-07 20:06:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2025-02-07 20:06:11,214 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 10 [2025-02-07 20:06:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:11,214 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2025-02-07 20:06:11,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-02-07 20:06:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2025-02-07 20:06:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 20:06:11,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:11,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:11,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:06:11,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:11,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 578172459, now seen corresponding path program 1 times [2025-02-07 20:06:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:11,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670288847] [2025-02-07 20:06:11,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:11,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 20:06:11,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 20:06:11,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:11,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670288847] [2025-02-07 20:06:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670288847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:11,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:06:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533981619] [2025-02-07 20:06:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:06:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:11,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:06:11,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:06:11,424 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-02-07 20:06:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:11,537 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2025-02-07 20:06:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:06:11,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-02-07 20:06:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:11,538 INFO L225 Difference]: With dead ends: 128 [2025-02-07 20:06:11,539 INFO L226 Difference]: Without dead ends: 124 [2025-02-07 20:06:11,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:06:11,540 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 163 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:11,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 172 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:06:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-07 20:06:11,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 77. [2025-02-07 20:06:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 76 states have internal predecessors, (86), 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-02-07 20:06:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-02-07 20:06:11,560 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 16 [2025-02-07 20:06:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-02-07 20:06:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-02-07 20:06:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2025-02-07 20:06:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:06:11,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:11,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:11,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:06:11,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:11,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:11,562 INFO L85 PathProgramCache]: Analyzing trace with hash 741691642, now seen corresponding path program 1 times [2025-02-07 20:06:11,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:11,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842362998] [2025-02-07 20:06:11,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:11,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:06:11,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:06:11,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:11,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:11,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842362998] [2025-02-07 20:06:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842362998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:11,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:11,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:06:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596321044] [2025-02-07 20:06:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:06:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:11,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:06:11,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:06:11,615 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-02-07 20:06:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:11,677 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2025-02-07 20:06:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:06:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-02-07 20:06:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:11,678 INFO L225 Difference]: With dead ends: 140 [2025-02-07 20:06:11,678 INFO L226 Difference]: Without dead ends: 119 [2025-02-07 20:06:11,679 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-02-07 20:06:11,679 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 143 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:11,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 125 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:06:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-07 20:06:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 76. [2025-02-07 20:06:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.25) internal successors, (85), 75 states have internal predecessors, (85), 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-02-07 20:06:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-02-07 20:06:11,688 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 17 [2025-02-07 20:06:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:11,688 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-02-07 20:06:11,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-02-07 20:06:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2025-02-07 20:06:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:06:11,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:11,689 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] [2025-02-07 20:06:11,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:06:11,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:11,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:11,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1869477970, now seen corresponding path program 1 times [2025-02-07 20:06:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508628144] [2025-02-07 20:06:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:11,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:11,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:06:11,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:06:11,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:11,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508628144] [2025-02-07 20:06:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508628144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:11,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:11,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:06:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501402878] [2025-02-07 20:06:11,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:11,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:06:11,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:11,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:06:11,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:06:11,730 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-02-07 20:06:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:11,743 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2025-02-07 20:06:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:06:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-02-07 20:06:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:11,745 INFO L225 Difference]: With dead ends: 126 [2025-02-07 20:06:11,746 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 20:06:11,746 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-02-07 20:06:11,746 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:11,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 159 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:06:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 20:06:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-02-07 20:06:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.25) internal successors, (90), 79 states have internal predecessors, (90), 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-02-07 20:06:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-02-07 20:06:11,755 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 22 [2025-02-07 20:06:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:11,756 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-02-07 20:06:11,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-02-07 20:06:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-02-07 20:06:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:06:11,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:11,756 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] [2025-02-07 20:06:11,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:06:11,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:11,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2119334574, now seen corresponding path program 1 times [2025-02-07 20:06:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:11,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384682439] [2025-02-07 20:06:11,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:11,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:11,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:06:11,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:06:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:11,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384682439] [2025-02-07 20:06:11,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384682439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:11,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:11,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:06:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916887245] [2025-02-07 20:06:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:06:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:11,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:06:11,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:06:11,789 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-07 20:06:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:11,803 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2025-02-07 20:06:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:06:11,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-02-07 20:06:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:11,804 INFO L225 Difference]: With dead ends: 80 [2025-02-07 20:06:11,804 INFO L226 Difference]: Without dead ends: 78 [2025-02-07 20:06:11,804 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-02-07 20:06:11,805 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 139 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-02-07 20:06:11,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 139 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:06:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-07 20:06:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-07 20:06:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 77 states have internal predecessors, (88), 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-02-07 20:06:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-02-07 20:06:11,813 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 23 [2025-02-07 20:06:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:11,814 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-02-07 20:06:11,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-07 20:06:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-02-07 20:06:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:06:11,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:11,815 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] [2025-02-07 20:06:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:06:11,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1800299089, now seen corresponding path program 1 times [2025-02-07 20:06:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179320928] [2025-02-07 20:06:11,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:11,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:06:11,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:06:11,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:11,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:11,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:11,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179320928] [2025-02-07 20:06:11,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179320928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:11,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:06:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272991603] [2025-02-07 20:06:11,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:11,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:06:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:11,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:06:11,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:06:11,931 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-02-07 20:06:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:11,985 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2025-02-07 20:06:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:06:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2025-02-07 20:06:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:11,986 INFO L225 Difference]: With dead ends: 79 [2025-02-07 20:06:11,986 INFO L226 Difference]: Without dead ends: 77 [2025-02-07 20:06:11,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:06:11,987 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:11,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:06:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-07 20:06:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-02-07 20:06:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 75 states have internal predecessors, (86), 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-02-07 20:06:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2025-02-07 20:06:11,997 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 25 [2025-02-07 20:06:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:11,997 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2025-02-07 20:06:11,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-02-07 20:06:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2025-02-07 20:06:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:06:11,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:11,998 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] [2025-02-07 20:06:11,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:06:11,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:11,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1076125338, now seen corresponding path program 1 times [2025-02-07 20:06:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863140693] [2025-02-07 20:06:11,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:12,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:06:12,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:06:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863140693] [2025-02-07 20:06:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863140693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:06:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543078791] [2025-02-07 20:06:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:06:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:12,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:06:12,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:06:12,137 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-02-07 20:06:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:12,294 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2025-02-07 20:06:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:06:12,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 26 [2025-02-07 20:06:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:12,295 INFO L225 Difference]: With dead ends: 192 [2025-02-07 20:06:12,295 INFO L226 Difference]: Without dead ends: 146 [2025-02-07 20:06:12,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:06:12,296 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 72 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:12,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 340 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:06:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-07 20:06:12,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2025-02-07 20:06:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.216867469879518) internal successors, (101), 88 states have internal predecessors, (101), 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-02-07 20:06:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2025-02-07 20:06:12,305 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 26 [2025-02-07 20:06:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:12,305 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2025-02-07 20:06:12,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-02-07 20:06:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2025-02-07 20:06:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:06:12,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:12,306 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] [2025-02-07 20:06:12,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:06:12,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:12,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1709246296, now seen corresponding path program 1 times [2025-02-07 20:06:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:12,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501396612] [2025-02-07 20:06:12,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:12,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:12,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:06:12,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:06:12,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:12,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501396612] [2025-02-07 20:06:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501396612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:13,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:06:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748492622] [2025-02-07 20:06:13,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:13,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:06:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:13,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:06:13,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:06:13,026 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-02-07 20:06:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:13,347 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2025-02-07 20:06:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:06:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 26 [2025-02-07 20:06:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:13,349 INFO L225 Difference]: With dead ends: 213 [2025-02-07 20:06:13,349 INFO L226 Difference]: Without dead ends: 211 [2025-02-07 20:06:13,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:06:13,350 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 209 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:13,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 439 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:06:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-07 20:06:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 103. [2025-02-07 20:06:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 102 states have internal predecessors, (117), 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-02-07 20:06:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2025-02-07 20:06:13,362 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 26 [2025-02-07 20:06:13,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:13,362 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2025-02-07 20:06:13,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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-02-07 20:06:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2025-02-07 20:06:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:06:13,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:13,364 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] [2025-02-07 20:06:13,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:06:13,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 961893032, now seen corresponding path program 1 times [2025-02-07 20:06:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177417374] [2025-02-07 20:06:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:13,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:06:13,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:06:13,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:13,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:06:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177417374] [2025-02-07 20:06:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177417374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:06:13,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:06:13,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:06:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072770123] [2025-02-07 20:06:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:06:13,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:06:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:13,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:06:13,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:06:13,430 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-02-07 20:06:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:13,526 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2025-02-07 20:06:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:06:13,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 29 [2025-02-07 20:06:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:13,527 INFO L225 Difference]: With dead ends: 152 [2025-02-07 20:06:13,527 INFO L226 Difference]: Without dead ends: 133 [2025-02-07 20:06:13,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:06:13,527 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:13,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 208 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:06:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-07 20:06:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2025-02-07 20:06:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 120 states have (on average 1.225) internal successors, (147), 125 states have internal predecessors, (147), 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-02-07 20:06:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2025-02-07 20:06:13,545 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 29 [2025-02-07 20:06:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:13,546 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2025-02-07 20:06:13,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-02-07 20:06:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2025-02-07 20:06:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:06:13,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:13,548 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] [2025-02-07 20:06:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:06:13,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2025-02-07 20:06:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash 976766792, now seen corresponding path program 1 times [2025-02-07 20:06:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911699297] [2025-02-07 20:06:13,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:13,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:06:13,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:06:13,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:13,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:06:13,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:06:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:06:13,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:06:13,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:13,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:06:13,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:06:13,594 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:06:13,595 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2025-02-07 20:06:13,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2025-02-07 20:06:13,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2025-02-07 20:06:13,596 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2025-02-07 20:06:13,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2025-02-07 20:06:13,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2025-02-07 20:06:13,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2025-02-07 20:06:13,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2025-02-07 20:06:13,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2025-02-07 20:06:13,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2025-02-07 20:06:13,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2025-02-07 20:06:13,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2025-02-07 20:06:13,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2025-02-07 20:06:13,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:06:13,603 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:13,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:06:13,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:06:13 BoogieIcfgContainer [2025-02-07 20:06:13,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:06:13,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:06:13,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:06:13,640 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:06:13,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:06:10" (3/4) ... [2025-02-07 20:06:13,641 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:06:13,678 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 24. [2025-02-07 20:06:13,725 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:06:13,726 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:06:13,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:06:13,726 INFO L158 Benchmark]: Toolchain (without parser) took 3932.37ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 110.0MB in the beginning and 187.9MB in the end (delta: -77.9MB). Peak memory consumption was 162.8MB. Max. memory is 16.1GB. [2025-02-07 20:06:13,726 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:06:13,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.02ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 91.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:06:13,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.70ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:06:13,727 INFO L158 Benchmark]: Boogie Preprocessor took 69.87ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:06:13,727 INFO L158 Benchmark]: IcfgBuilder took 396.37ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 65.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:06:13,727 INFO L158 Benchmark]: TraceAbstraction took 2999.18ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 64.7MB in the beginning and 196.3MB in the end (delta: -131.7MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. [2025-02-07 20:06:13,727 INFO L158 Benchmark]: Witness Printer took 86.16ms. Allocated memory is still 385.9MB. Free memory was 196.3MB in the beginning and 187.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:06:13,728 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.02ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 91.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.70ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.87ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 396.37ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 65.1MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2999.18ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 64.7MB in the beginning and 196.3MB in the end (delta: -131.7MB). Peak memory consumption was 120.9MB. Max. memory is 16.1GB. * Witness Printer took 86.16ms. Allocated memory is still 385.9MB. Free memory was 196.3MB in the beginning and 187.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) [L1006] COND TRUE 0 VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(0) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] COND TRUE 0 [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] COND FALSE !(0) VAL [list={-1:0}] [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND TRUE __VERIFIER_nondet_int() [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND TRUE 0 VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND TRUE 0 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] COND TRUE 0 [L1039] EXPR inner->inner [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1039] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1040] COND TRUE 0 [L1040] EXPR inner->next [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1057]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 740 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 2038 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1243 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 795 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 285 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-07 20:06:13,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE