./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:17:51,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:17:51,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 10:17:51,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:17:51,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:17:51,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:17:51,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:17:51,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:17:51,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:17:51,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:17:51,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:17:51,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:17:51,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:17:51,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:17:51,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:17:51,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:17:51,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:17:51,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:17:51,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:17:51,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:17:51,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:17:51,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:17:51,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:17:51,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:17:51,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:17:51,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:17:51,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-03-17 10:17:51,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:17:51,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:17:51,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:17:51,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:17:51,388 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:17:51,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-17 10:17:52,588 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e908ecc58/e2ece1d4aaba4eaba389153edc319981/FLAGe7a9bc5f5 [2025-03-17 10:17:53,031 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:17:53,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-17 10:17:53,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e908ecc58/e2ece1d4aaba4eaba389153edc319981/FLAGe7a9bc5f5 [2025-03-17 10:17:53,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e908ecc58/e2ece1d4aaba4eaba389153edc319981 [2025-03-17 10:17:53,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:17:53,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:17:53,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:17:53,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:17:53,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:17:53,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:17:53" (1/1) ... [2025-03-17 10:17:53,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226f7e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:53, skipping insertion in model container [2025-03-17 10:17:53,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:17:53" (1/1) ... [2025-03-17 10:17:53,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:17:53,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103699,103712] [2025-03-17 10:17:53,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103875,103888] [2025-03-17 10:17:53,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104048,104061] [2025-03-17 10:17:53,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104259,104272] [2025-03-17 10:17:53,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104572,104585] [2025-03-17 10:17:53,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[106719,106732] [2025-03-17 10:17:53,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109080,109093] [2025-03-17 10:17:53,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109532,109545] [2025-03-17 10:17:53,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109885,109898] [2025-03-17 10:17:53,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[110424,110437] [2025-03-17 10:17:53,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111343,111356] [2025-03-17 10:17:53,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111696,111709] [2025-03-17 10:17:53,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112237,112250] [2025-03-17 10:17:53,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112970,112983] [2025-03-17 10:17:54,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:17:54,058 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:17:54,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103699,103712] [2025-03-17 10:17:54,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[103875,103888] [2025-03-17 10:17:54,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104048,104061] [2025-03-17 10:17:54,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104259,104272] [2025-03-17 10:17:54,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[104572,104585] [2025-03-17 10:17:54,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[106719,106732] [2025-03-17 10:17:54,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109080,109093] [2025-03-17 10:17:54,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109532,109545] [2025-03-17 10:17:54,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[109885,109898] [2025-03-17 10:17:54,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[110424,110437] [2025-03-17 10:17:54,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111343,111356] [2025-03-17 10:17:54,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[111696,111709] [2025-03-17 10:17:54,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112237,112250] [2025-03-17 10:17:54,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i[112970,112983] [2025-03-17 10:17:54,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:17:54,300 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 10:17:54,305 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:17:54,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54 WrapperNode [2025-03-17 10:17:54,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:17:54,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:17:54,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:17:54,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:17:54,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,407 INFO L138 Inliner]: procedures = 648, calls = 850, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1825 [2025-03-17 10:17:54,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:17:54,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:17:54,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:17:54,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:17:54,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,436 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 10:17:54,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:17:54,519 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:17:54,519 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:17:54,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:17:54,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (1/1) ... [2025-03-17 10:17:54,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:17:54,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:17:54,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:17:54,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-17 10:17:54,570 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-17 10:17:54,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 10:17:54,570 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 10:17:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-17 10:17:54,571 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-17 10:17:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:17:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-17 10:17:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-17 10:17:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-17 10:17:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-17 10:17:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-17 10:17:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:17:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-17 10:17:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-17 10:17:54,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:17:54,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:17:55,060 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-17 10:17:55,284 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-17 10:17:55,329 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-17 10:17:55,521 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-17 10:17:55,521 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-17 10:17:55,521 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-17 10:17:55,521 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-17 10:18:02,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-17 10:18:02,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-17 10:18:02,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-17 10:18:02,168 INFO L? ?]: Removed 538 outVars from TransFormulas that were not future-live. [2025-03-17 10:18:02,168 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:18:02,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:18:02,188 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:18:02,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:18:02 BoogieIcfgContainer [2025-03-17 10:18:02,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:18:02,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:18:02,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:18:02,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:18:02,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:17:53" (1/3) ... [2025-03-17 10:18:02,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f18c902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:18:02, skipping insertion in model container [2025-03-17 10:18:02,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:17:54" (2/3) ... [2025-03-17 10:18:02,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f18c902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:18:02, skipping insertion in model container [2025-03-17 10:18:02,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:18:02" (3/3) ... [2025-03-17 10:18:02,197 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-17 10:18:02,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:18:02,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 14 procedures, 406 locations, 1 initial locations, 23 loop locations, and 16 error locations. [2025-03-17 10:18:02,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:18:02,275 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;@25bc5ee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:18:02,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 10:18:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 406 states, 338 states have (on average 1.5621301775147929) internal successors, (528), 355 states have internal predecessors, (528), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 10:18:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 10:18:02,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:02,289 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] [2025-03-17 10:18:02,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:02,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1957870931, now seen corresponding path program 1 times [2025-03-17 10:18:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988801995] [2025-03-17 10:18:02,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:03,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 10:18:03,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 10:18:03,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:03,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:03,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:03,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988801995] [2025-03-17 10:18:03,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988801995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:03,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:03,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:03,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249447780] [2025-03-17 10:18:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:03,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:03,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:03,740 INFO L87 Difference]: Start difference. First operand has 406 states, 338 states have (on average 1.5621301775147929) internal successors, (528), 355 states have internal predecessors, (528), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:03,858 INFO L93 Difference]: Finished difference Result 769 states and 1167 transitions. [2025-03-17 10:18:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:03,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 10:18:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:03,871 INFO L225 Difference]: With dead ends: 769 [2025-03-17 10:18:03,871 INFO L226 Difference]: Without dead ends: 356 [2025-03-17 10:18:03,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:03,882 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:03,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 997 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:18:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-17 10:18:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-17 10:18:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 295 states have (on average 1.4440677966101696) internal successors, (426), 312 states have internal predecessors, (426), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 10:18:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 492 transitions. [2025-03-17 10:18:03,929 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 492 transitions. Word has length 24 [2025-03-17 10:18:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:03,929 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 492 transitions. [2025-03-17 10:18:03,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 492 transitions. [2025-03-17 10:18:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 10:18:03,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:03,931 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-03-17 10:18:03,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:18:03,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:03,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1724894184, now seen corresponding path program 1 times [2025-03-17 10:18:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:03,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133928107] [2025-03-17 10:18:03,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:03,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:04,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 10:18:04,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 10:18:04,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:04,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133928107] [2025-03-17 10:18:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133928107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830908494] [2025-03-17 10:18:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:04,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:04,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:04,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:18:04,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:18:05,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 10:18:05,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 10:18:05,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:05,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:05,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1908 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:18:05,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:18:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:05,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:18:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830908494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:18:05,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:18:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 10:18:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47279714] [2025-03-17 10:18:05,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:18:05,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:18:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:05,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:18:05,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:18:05,774 INFO L87 Difference]: Start difference. First operand 356 states and 492 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:05,865 INFO L93 Difference]: Finished difference Result 712 states and 986 transitions. [2025-03-17 10:18:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:05,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-17 10:18:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:05,868 INFO L225 Difference]: With dead ends: 712 [2025-03-17 10:18:05,868 INFO L226 Difference]: Without dead ends: 359 [2025-03-17 10:18:05,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:18:05,869 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:05,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1454 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-17 10:18:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-17 10:18:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 298 states have (on average 1.4395973154362416) internal successors, (429), 315 states have internal predecessors, (429), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 10:18:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 495 transitions. [2025-03-17 10:18:05,898 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 495 transitions. Word has length 25 [2025-03-17 10:18:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:05,898 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 495 transitions. [2025-03-17 10:18:05,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 495 transitions. [2025-03-17 10:18:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 10:18:05,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:05,899 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:05,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 10:18:06,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:06,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:06,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1091375092, now seen corresponding path program 2 times [2025-03-17 10:18:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:06,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772533538] [2025-03-17 10:18:06,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:18:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:06,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-17 10:18:06,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-17 10:18:06,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:18:06,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 10:18:07,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772533538] [2025-03-17 10:18:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772533538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:07,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:18:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146232783] [2025-03-17 10:18:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:07,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:18:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:07,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:18:07,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:07,002 INFO L87 Difference]: Start difference. First operand 359 states and 495 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:07,131 INFO L93 Difference]: Finished difference Result 375 states and 510 transitions. [2025-03-17 10:18:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:07,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-17 10:18:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:07,135 INFO L225 Difference]: With dead ends: 375 [2025-03-17 10:18:07,135 INFO L226 Difference]: Without dead ends: 367 [2025-03-17 10:18:07,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:18:07,135 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 17 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:07,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2407 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-17 10:18:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2025-03-17 10:18:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.4337748344370862) internal successors, (433), 318 states have internal predecessors, (433), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 10:18:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 500 transitions. [2025-03-17 10:18:07,148 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 500 transitions. Word has length 28 [2025-03-17 10:18:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:07,149 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 500 transitions. [2025-03-17 10:18:07,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 500 transitions. [2025-03-17 10:18:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 10:18:07,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:07,150 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:07,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:18:07,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1091374131, now seen corresponding path program 1 times [2025-03-17 10:18:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020610919] [2025-03-17 10:18:07,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:07,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:18:07,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:18:07,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:07,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020610919] [2025-03-17 10:18:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020610919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245488681] [2025-03-17 10:18:08,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:08,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:08,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:08,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:18:08,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:18:08,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:18:08,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:18:08,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:08,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:08,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1964 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:18:08,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:18:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:08,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:18:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:18:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245488681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:18:09,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:18:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-03-17 10:18:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15531184] [2025-03-17 10:18:09,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:18:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 10:18:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:09,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 10:18:09,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:18:09,129 INFO L87 Difference]: Start difference. First operand 364 states and 500 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:09,213 INFO L93 Difference]: Finished difference Result 728 states and 1005 transitions. [2025-03-17 10:18:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 10:18:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-17 10:18:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:09,215 INFO L225 Difference]: With dead ends: 728 [2025-03-17 10:18:09,215 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 10:18:09,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 10:18:09,217 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:09,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1454 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:18:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 10:18:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-17 10:18:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 308 states have (on average 1.4253246753246753) internal successors, (439), 324 states have internal predecessors, (439), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 10:18:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 506 transitions. [2025-03-17 10:18:09,226 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 506 transitions. Word has length 28 [2025-03-17 10:18:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:09,226 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 506 transitions. [2025-03-17 10:18:09,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 10:18:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 506 transitions. [2025-03-17 10:18:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 10:18:09,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:09,227 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:09,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 10:18:09,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 10:18:09,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:09,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1560926643, now seen corresponding path program 2 times [2025-03-17 10:18:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:09,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019925010] [2025-03-17 10:18:09,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:18:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:09,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-17 10:18:10,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 34 statements. [2025-03-17 10:18:10,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:18:10,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:10,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:10,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019925010] [2025-03-17 10:18:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019925010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:10,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:18:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356932553] [2025-03-17 10:18:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:10,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:18:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:10,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:18:10,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:10,398 INFO L87 Difference]: Start difference. First operand 370 states and 506 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:14,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:18,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:18,709 INFO L93 Difference]: Finished difference Result 726 states and 996 transitions. [2025-03-17 10:18:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:18,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-17 10:18:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:18,712 INFO L225 Difference]: With dead ends: 726 [2025-03-17 10:18:18,712 INFO L226 Difference]: Without dead ends: 372 [2025-03-17 10:18:18,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:18:18,713 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 134 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:18,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1898 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-17 10:18:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-17 10:18:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2025-03-17 10:18:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 309 states have (on average 1.4239482200647249) internal successors, (440), 325 states have internal predecessors, (440), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 10:18:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 507 transitions. [2025-03-17 10:18:18,722 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 507 transitions. Word has length 34 [2025-03-17 10:18:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:18,722 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 507 transitions. [2025-03-17 10:18:18,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 507 transitions. [2025-03-17 10:18:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 10:18:18,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:18,723 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:18,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:18:18,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:18,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash -370529205, now seen corresponding path program 1 times [2025-03-17 10:18:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:18,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527152710] [2025-03-17 10:18:18,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:19,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 10:18:19,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 10:18:19,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:19,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:19,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527152710] [2025-03-17 10:18:19,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527152710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:18:19,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:18:19,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:18:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634339719] [2025-03-17 10:18:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:18:19,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:18:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:19,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:18:19,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:19,377 INFO L87 Difference]: Start difference. First operand 371 states and 507 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:23,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:23,493 INFO L93 Difference]: Finished difference Result 728 states and 999 transitions. [2025-03-17 10:18:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:18:23,493 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-17 10:18:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:23,496 INFO L225 Difference]: With dead ends: 728 [2025-03-17 10:18:23,496 INFO L226 Difference]: Without dead ends: 372 [2025-03-17 10:18:23,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:18:23,498 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:23,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 969 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 10:18:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-17 10:18:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-17 10:18:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 310 states have (on average 1.4225806451612903) internal successors, (441), 326 states have internal predecessors, (441), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 10:18:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 508 transitions. [2025-03-17 10:18:23,519 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 508 transitions. Word has length 36 [2025-03-17 10:18:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:23,519 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 508 transitions. [2025-03-17 10:18:23,519 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 508 transitions. [2025-03-17 10:18:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 10:18:23,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:23,521 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:23,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:18:23,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:23,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1426277436, now seen corresponding path program 1 times [2025-03-17 10:18:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550575479] [2025-03-17 10:18:23,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:23,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 10:18:24,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 10:18:24,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:24,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550575479] [2025-03-17 10:18:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550575479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:24,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218786795] [2025-03-17 10:18:24,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:18:24,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:24,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:24,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:18:24,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:18:24,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 10:18:25,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 10:18:25,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:18:25,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:25,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 2175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:18:25,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:18:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:25,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:18:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218786795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:18:25,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:18:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:18:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124567088] [2025-03-17 10:18:25,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:18:25,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:18:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:18:25,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:18:25,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:18:25,234 INFO L87 Difference]: Start difference. First operand 372 states and 508 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:29,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:33,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:37,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:41,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:45,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:18:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:18:45,530 INFO L93 Difference]: Finished difference Result 732 states and 1005 transitions. [2025-03-17 10:18:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:18:45,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-17 10:18:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:18:45,532 INFO L225 Difference]: With dead ends: 732 [2025-03-17 10:18:45,532 INFO L226 Difference]: Without dead ends: 375 [2025-03-17 10:18:45,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:18:45,536 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:18:45,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1935 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2025-03-17 10:18:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-17 10:18:45,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-17 10:18:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 313 states have (on average 1.4185303514376997) internal successors, (444), 329 states have internal predecessors, (444), 35 states have call successors, (35), 14 states have call predecessors, (35), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 10:18:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 511 transitions. [2025-03-17 10:18:45,554 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 511 transitions. Word has length 37 [2025-03-17 10:18:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:18:45,555 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 511 transitions. [2025-03-17 10:18:45,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 10:18:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 511 transitions. [2025-03-17 10:18:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 10:18:45,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:18:45,557 INFO L218 NwaCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:18:45,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 10:18:45,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:45,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bb_verror_msgErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [multiconvertErr0ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr1ASSERT_VIOLATIONERROR_FUNCTION, multiconvertErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-17 10:18:45,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:18:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1936269451, now seen corresponding path program 2 times [2025-03-17 10:18:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:18:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023942704] [2025-03-17 10:18:45,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:18:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:18:46,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-17 10:18:46,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:18:46,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:18:46,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:18:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-17 10:18:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:18:46,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023942704] [2025-03-17 10:18:46,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023942704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:18:46,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277785769] [2025-03-17 10:18:46,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:18:46,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:18:46,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:18:46,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:18:46,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 10:18:47,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.