./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_sync.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:24:46,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:24:46,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:24:46,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:24:46,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:24:46,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:24:46,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:24:46,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:24:46,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:24:46,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:24:46,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:24:46,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:24:46,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:24:46,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:24:46,349 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:24:46,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:24:46,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:24:46,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:24:46,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:24:46,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:46,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:24:46,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:24:46,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:24:46,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:24:46,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:24:46,352 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2025-03-03 15:24:46,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:24:46,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:24:46,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:24:46,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:24:46,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:24:46,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2025-03-03 15:24:47,719 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2484fd870/ddc37fdec2f4490da5fa37911ead0898/FLAG14502cfe1 [2025-03-03 15:24:48,046 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:24:48,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2025-03-03 15:24:48,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2484fd870/ddc37fdec2f4490da5fa37911ead0898/FLAG14502cfe1 [2025-03-03 15:24:48,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2484fd870/ddc37fdec2f4490da5fa37911ead0898 [2025-03-03 15:24:48,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:24:48,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:24:48,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:48,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:24:48,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:24:48,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2217ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48, skipping insertion in model container [2025-03-03 15:24:48,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:24:48,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i[34698,34711] [2025-03-03 15:24:48,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:48,726 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:24:48,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i[34698,34711] [2025-03-03 15:24:48,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:48,841 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:24:48,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48 WrapperNode [2025-03-03 15:24:48,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:48,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:48,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:24:48,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:24:48,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,886 INFO L138 Inliner]: procedures = 245, calls = 253, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 551 [2025-03-03 15:24:48,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:48,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:24:48,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:24:48,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:24:48,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,926 INFO L175 MemorySlicer]: Split 126 memory accesses to 17 slices as follows [3, 2, 3, 8, 8, 8, 20, 16, 12, 7, 12, 7, 0, 3, 8, 3, 6]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [0, 2, 0, 3, 3, 3, 6, 6, 2, 0, 2, 0, 0, 0, 4, 0, 2]. The 38 writes are split as follows [1, 0, 1, 2, 2, 2, 8, 5, 4, 1, 5, 1, 0, 1, 2, 1, 2]. [2025-03-03 15:24:48,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:24:48,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:24:48,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:24:48,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:24:48,969 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (1/1) ... [2025-03-03 15:24:48,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:48,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:48,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:24:48,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:24:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:24:49,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:24:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:24:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2025-03-03 15:24:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2025-03-03 15:24:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-03 15:24:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-03 15:24:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:24:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:24:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:24:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:24:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-03 15:24:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2025-03-03 15:24:49,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:24:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:24:49,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:24:49,022 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2025-03-03 15:24:49,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2025-03-03 15:24:49,025 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:24:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:24:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 15:24:49,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:24:49,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:24:49,238 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:24:49,240 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:24:49,606 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:49,607 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:49,907 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-03 15:24:49,907 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:24:49,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:24:49,920 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:24:49,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:49 BoogieIcfgContainer [2025-03-03 15:24:49,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:24:49,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:24:49,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:24:49,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:24:49,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:24:48" (1/3) ... [2025-03-03 15:24:49,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc6749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:49, skipping insertion in model container [2025-03-03 15:24:49,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:48" (2/3) ... [2025-03-03 15:24:49,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bc6749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:49, skipping insertion in model container [2025-03-03 15:24:49,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:49" (3/3) ... [2025-03-03 15:24:49,930 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2025-03-03 15:24:49,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:24:49,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_sync.i that has 11 procedures, 186 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 15:24:49,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:24:49,993 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;@672e19ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:24:49,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:24:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 15:24:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:24:50,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:50,007 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:50,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:50,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2136996797, now seen corresponding path program 1 times [2025-03-03 15:24:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785762430] [2025-03-03 15:24:50,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:50,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:24:50,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:24:50,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:50,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785762430] [2025-03-03 15:24:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785762430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:50,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945433747] [2025-03-03 15:24:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:50,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:50,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:50,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:50,451 INFO L87 Difference]: Start difference. First operand has 186 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:50,563 INFO L93 Difference]: Finished difference Result 370 states and 607 transitions. [2025-03-03 15:24:50,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:50,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-03-03 15:24:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:50,578 INFO L225 Difference]: With dead ends: 370 [2025-03-03 15:24:50,578 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 15:24:50,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:50,587 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:50,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 549 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:24:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 15:24:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2025-03-03 15:24:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 15:24:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 276 transitions. [2025-03-03 15:24:50,638 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 276 transitions. Word has length 71 [2025-03-03 15:24:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:50,638 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 276 transitions. [2025-03-03 15:24:50,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 276 transitions. [2025-03-03 15:24:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:24:50,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:50,642 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:50,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:24:50,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:50,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1843400155, now seen corresponding path program 1 times [2025-03-03 15:24:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:50,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17372206] [2025-03-03 15:24:50,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:50,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:24:50,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:24:50,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:50,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:50,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17372206] [2025-03-03 15:24:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17372206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:50,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:50,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014657024] [2025-03-03 15:24:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:50,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:50,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:50,837 INFO L87 Difference]: Start difference. First operand 183 states and 276 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:50,879 INFO L93 Difference]: Finished difference Result 364 states and 551 transitions. [2025-03-03 15:24:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-03-03 15:24:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:50,881 INFO L225 Difference]: With dead ends: 364 [2025-03-03 15:24:50,883 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 15:24:50,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:50,885 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:50,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 15:24:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-03 15:24:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 118 states have internal predecessors, (167), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 15:24:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 277 transitions. [2025-03-03 15:24:50,907 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 277 transitions. Word has length 73 [2025-03-03 15:24:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:50,907 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 277 transitions. [2025-03-03 15:24:50,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2025-03-03 15:24:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:24:50,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:50,912 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:50,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:24:50,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:50,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1015932817, now seen corresponding path program 1 times [2025-03-03 15:24:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:50,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365931523] [2025-03-03 15:24:50,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:50,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:24:50,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:24:50,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:50,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365931523] [2025-03-03 15:24:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365931523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958255043] [2025-03-03 15:24:51,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:51,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:51,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:51,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:51,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:24:51,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:24:51,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:24:51,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:51,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:51,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:24:51,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:51,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:51,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958255043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:51,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:24:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151083288] [2025-03-03 15:24:51,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:51,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:51,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:51,499 INFO L87 Difference]: Start difference. First operand 184 states and 277 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 15:24:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:51,531 INFO L93 Difference]: Finished difference Result 367 states and 555 transitions. [2025-03-03 15:24:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:24:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 74 [2025-03-03 15:24:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:51,534 INFO L225 Difference]: With dead ends: 367 [2025-03-03 15:24:51,534 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 15:24:51,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:51,536 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:51,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 15:24:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-03 15:24:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 120 states have internal predecessors, (169), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 15:24:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 279 transitions. [2025-03-03 15:24:51,550 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 279 transitions. Word has length 74 [2025-03-03 15:24:51,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:51,550 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 279 transitions. [2025-03-03 15:24:51,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 15:24:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 279 transitions. [2025-03-03 15:24:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:24:51,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:51,554 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:51,562 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-03 15:24:51,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:51,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:51,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash 507087057, now seen corresponding path program 2 times [2025-03-03 15:24:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:51,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521278783] [2025-03-03 15:24:51,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:51,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 15:24:51,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 76 statements. [2025-03-03 15:24:51,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:51,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-03 15:24:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521278783] [2025-03-03 15:24:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521278783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76312257] [2025-03-03 15:24:51,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:51,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:51,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:51,972 INFO L87 Difference]: Start difference. First operand 186 states and 279 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:52,026 INFO L93 Difference]: Finished difference Result 362 states and 553 transitions. [2025-03-03 15:24:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:52,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2025-03-03 15:24:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:52,033 INFO L225 Difference]: With dead ends: 362 [2025-03-03 15:24:52,033 INFO L226 Difference]: Without dead ends: 336 [2025-03-03 15:24:52,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:52,035 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 237 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:52,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 938 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:52,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-03 15:24:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2025-03-03 15:24:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 215 states have (on average 1.4325581395348836) internal successors, (308), 215 states have internal predecessors, (308), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-03-03 15:24:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 514 transitions. [2025-03-03 15:24:52,075 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 514 transitions. Word has length 76 [2025-03-03 15:24:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:52,075 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 514 transitions. [2025-03-03 15:24:52,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 514 transitions. [2025-03-03 15:24:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:24:52,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:52,082 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:52,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:24:52,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:52,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1625760722, now seen corresponding path program 1 times [2025-03-03 15:24:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:52,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191562563] [2025-03-03 15:24:52,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:52,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:24:52,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:24:52,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:52,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-03 15:24:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191562563] [2025-03-03 15:24:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191562563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833876599] [2025-03-03 15:24:52,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:52,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:52,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:52,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:52,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:24:52,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:24:52,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:24:52,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:52,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:52,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:24:52,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-03 15:24:52,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-03 15:24:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833876599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:52,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:52,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-03 15:24:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514435554] [2025-03-03 15:24:52,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:52,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:52,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:52,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:52,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:52,951 INFO L87 Difference]: Start difference. First operand 335 states and 514 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:24:53,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:53,042 INFO L93 Difference]: Finished difference Result 667 states and 1025 transitions. [2025-03-03 15:24:53,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:53,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 170 [2025-03-03 15:24:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:53,047 INFO L225 Difference]: With dead ends: 667 [2025-03-03 15:24:53,048 INFO L226 Difference]: Without dead ends: 340 [2025-03-03 15:24:53,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:53,049 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:53,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:24:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-03 15:24:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-03 15:24:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 220 states have (on average 1.4272727272727272) internal successors, (314), 220 states have internal predecessors, (314), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-03-03 15:24:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 520 transitions. [2025-03-03 15:24:53,066 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 520 transitions. Word has length 170 [2025-03-03 15:24:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:53,066 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 520 transitions. [2025-03-03 15:24:53,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:24:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 520 transitions. [2025-03-03 15:24:53,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 15:24:53,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:53,069 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:53,078 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-03 15:24:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:53,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1841553338, now seen corresponding path program 1 times [2025-03-03 15:24:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047864984] [2025-03-03 15:24:53,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:53,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 15:24:53,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 15:24:53,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:53,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-03 15:24:53,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047864984] [2025-03-03 15:24:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047864984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:53,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341453173] [2025-03-03 15:24:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:53,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:53,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:53,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:53,791 INFO L87 Difference]: Start difference. First operand 340 states and 520 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 15:24:54,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:58,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:59,201 INFO L93 Difference]: Finished difference Result 707 states and 1089 transitions. [2025-03-03 15:24:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 175 [2025-03-03 15:24:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:59,208 INFO L225 Difference]: With dead ends: 707 [2025-03-03 15:24:59,208 INFO L226 Difference]: Without dead ends: 677 [2025-03-03 15:24:59,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:59,210 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 311 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:59,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1031 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 96 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-03-03 15:24:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-03 15:24:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 670. [2025-03-03 15:24:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 429 states have (on average 1.4289044289044288) internal successors, (613), 432 states have internal predecessors, (613), 197 states have call successors, (197), 40 states have call predecessors, (197), 43 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2025-03-03 15:24:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1039 transitions. [2025-03-03 15:24:59,261 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1039 transitions. Word has length 175 [2025-03-03 15:24:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1039 transitions. [2025-03-03 15:24:59,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 15:24:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1039 transitions. [2025-03-03 15:24:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 15:24:59,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:59,266 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:59,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:24:59,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:59,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1710973346, now seen corresponding path program 1 times [2025-03-03 15:24:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:59,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482294059] [2025-03-03 15:24:59,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:59,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 15:24:59,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 15:24:59,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:59,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-03 15:24:59,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:59,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482294059] [2025-03-03 15:24:59,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482294059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:59,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:59,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:59,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957205164] [2025-03-03 15:24:59,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:59,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:59,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:59,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:59,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:59,690 INFO L87 Difference]: Start difference. First operand 670 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 15:25:00,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:00,899 INFO L93 Difference]: Finished difference Result 1077 states and 1649 transitions. [2025-03-03 15:25:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:00,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2025-03-03 15:25:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:00,906 INFO L225 Difference]: With dead ends: 1077 [2025-03-03 15:25:00,906 INFO L226 Difference]: Without dead ends: 666 [2025-03-03 15:25:00,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:25:00,908 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 259 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:00,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 894 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:25:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-03 15:25:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 659. [2025-03-03 15:25:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 421 states have (on average 1.4275534441805227) internal successors, (601), 423 states have internal predecessors, (601), 195 states have call successors, (195), 40 states have call predecessors, (195), 42 states have return successors, (223), 195 states have call predecessors, (223), 195 states have call successors, (223) [2025-03-03 15:25:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1019 transitions. [2025-03-03 15:25:00,967 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1019 transitions. Word has length 175 [2025-03-03 15:25:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:00,967 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1019 transitions. [2025-03-03 15:25:00,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 15:25:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1019 transitions. [2025-03-03 15:25:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 15:25:00,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:00,972 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:00,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:25:00,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:00,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:00,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1528064126, now seen corresponding path program 1 times [2025-03-03 15:25:00,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:00,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360140777] [2025-03-03 15:25:00,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:00,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:01,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 15:25:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 15:25:01,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-03 15:25:01,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:01,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360140777] [2025-03-03 15:25:01,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360140777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:01,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:01,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:25:01,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930405367] [2025-03-03 15:25:01,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:01,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:25:01,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:01,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:25:01,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:25:01,340 INFO L87 Difference]: Start difference. First operand 659 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 15:25:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:01,702 INFO L93 Difference]: Finished difference Result 1235 states and 1895 transitions. [2025-03-03 15:25:01,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:01,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2025-03-03 15:25:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:01,706 INFO L225 Difference]: With dead ends: 1235 [2025-03-03 15:25:01,706 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 15:25:01,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:25:01,709 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 255 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:01,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 895 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:25:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 15:25:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 571. [2025-03-03 15:25:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 366 states have (on average 1.360655737704918) internal successors, (498), 368 states have internal predecessors, (498), 168 states have call successors, (168), 35 states have call predecessors, (168), 36 states have return successors, (188), 167 states have call predecessors, (188), 168 states have call successors, (188) [2025-03-03 15:25:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 854 transitions. [2025-03-03 15:25:01,737 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 854 transitions. Word has length 175 [2025-03-03 15:25:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:01,738 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 854 transitions. [2025-03-03 15:25:01,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 15:25:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 854 transitions. [2025-03-03 15:25:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 15:25:01,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:01,740 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:01,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:25:01,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:01,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -536164126, now seen corresponding path program 1 times [2025-03-03 15:25:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:01,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643626029] [2025-03-03 15:25:01,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:01,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:01,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 15:25:01,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 15:25:01,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:01,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-03 15:25:02,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:02,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643626029] [2025-03-03 15:25:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643626029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:02,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:02,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:25:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371145030] [2025-03-03 15:25:02,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:02,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:25:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:02,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:25:02,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:25:02,146 INFO L87 Difference]: Start difference. First operand 571 states and 854 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 15:25:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:02,537 INFO L93 Difference]: Finished difference Result 618 states and 912 transitions. [2025-03-03 15:25:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:25:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 175 [2025-03-03 15:25:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:02,542 INFO L225 Difference]: With dead ends: 618 [2025-03-03 15:25:02,543 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 15:25:02,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:25:02,545 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 258 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:02,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1150 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:25:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 15:25:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 535. [2025-03-03 15:25:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 346 states have (on average 1.3583815028901733) internal successors, (470), 347 states have internal predecessors, (470), 152 states have call successors, (152), 35 states have call predecessors, (152), 36 states have return successors, (171), 152 states have call predecessors, (171), 152 states have call successors, (171) [2025-03-03 15:25:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 793 transitions. [2025-03-03 15:25:02,576 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 793 transitions. Word has length 175 [2025-03-03 15:25:02,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:02,576 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 793 transitions. [2025-03-03 15:25:02,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 15:25:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 793 transitions. [2025-03-03 15:25:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 15:25:02,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:02,580 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:02,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:25:02,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1829971542, now seen corresponding path program 1 times [2025-03-03 15:25:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334236708] [2025-03-03 15:25:02,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:02,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:25:02,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:25:02,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:02,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 15:25:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:03,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334236708] [2025-03-03 15:25:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334236708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:03,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:03,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:25:03,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314400145] [2025-03-03 15:25:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:03,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:25:03,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:03,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:25:03,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:25:03,056 INFO L87 Difference]: Start difference. First operand 535 states and 793 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 15:25:07,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:07,405 INFO L93 Difference]: Finished difference Result 576 states and 842 transitions. [2025-03-03 15:25:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:25:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 190 [2025-03-03 15:25:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:07,411 INFO L225 Difference]: With dead ends: 576 [2025-03-03 15:25:07,411 INFO L226 Difference]: Without dead ends: 476 [2025-03-03 15:25:07,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:25:07,413 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 236 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:07,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1098 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 15:25:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-03 15:25:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 472. [2025-03-03 15:25:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 304 states have (on average 1.355263157894737) internal successors, (412), 305 states have internal predecessors, (412), 136 states have call successors, (136), 29 states have call predecessors, (136), 31 states have return successors, (154), 137 states have call predecessors, (154), 136 states have call successors, (154) [2025-03-03 15:25:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 702 transitions. [2025-03-03 15:25:07,447 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 702 transitions. Word has length 190 [2025-03-03 15:25:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:07,447 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 702 transitions. [2025-03-03 15:25:07,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 15:25:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 702 transitions. [2025-03-03 15:25:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 15:25:07,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:07,451 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:25:07,451 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 175334671, now seen corresponding path program 1 times [2025-03-03 15:25:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142265238] [2025-03-03 15:25:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:07,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 15:25:07,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 15:25:07,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:07,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-03 15:25:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142265238] [2025-03-03 15:25:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142265238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678916676] [2025-03-03 15:25:07,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:07,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:07,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:25:07,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:25:08,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 15:25:08,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 15:25:08,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:08,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:08,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:25:08,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 640 proven. 4 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2025-03-03 15:25:08,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-03 15:25:08,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678916676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:08,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:08,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-03 15:25:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138855365] [2025-03-03 15:25:08,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:08,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:25:08,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:08,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:25:08,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:25:08,919 INFO L87 Difference]: Start difference. First operand 472 states and 702 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-03-03 15:25:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:09,984 INFO L93 Difference]: Finished difference Result 1194 states and 1805 transitions. [2025-03-03 15:25:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:25:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) Word has length 255 [2025-03-03 15:25:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:09,989 INFO L225 Difference]: With dead ends: 1194 [2025-03-03 15:25:09,989 INFO L226 Difference]: Without dead ends: 758 [2025-03-03 15:25:09,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:25:09,992 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 658 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:09,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1044 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:25:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-03 15:25:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 741. [2025-03-03 15:25:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 475 states have (on average 1.3789473684210527) internal successors, (655), 478 states have internal predecessors, (655), 212 states have call successors, (212), 51 states have call predecessors, (212), 53 states have return successors, (244), 211 states have call predecessors, (244), 212 states have call successors, (244) [2025-03-03 15:25:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1111 transitions. [2025-03-03 15:25:10,049 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1111 transitions. Word has length 255 [2025-03-03 15:25:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:10,051 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1111 transitions. [2025-03-03 15:25:10,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-03-03 15:25:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1111 transitions. [2025-03-03 15:25:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 15:25:10,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:10,056 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:10,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:25:10,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:10,257 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:10,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1136057649, now seen corresponding path program 1 times [2025-03-03 15:25:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131562498] [2025-03-03 15:25:10,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:10,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 15:25:10,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 15:25:10,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:10,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-03 15:25:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131562498] [2025-03-03 15:25:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131562498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782845113] [2025-03-03 15:25:11,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:11,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:25:11,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:25:12,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 15:25:12,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 15:25:12,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:12,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:12,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 15:25:12,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:12,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-03 15:25:23,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 15:25:23,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:25:23,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-03 15:25:24,963 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-03 15:25:24,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-03-03 15:25:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1031 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-03 15:25:39,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:39,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-03-03 15:25:39,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-03 15:25:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782845113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:46,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:25:46,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2025-03-03 15:25:46,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556238478] [2025-03-03 15:25:46,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:46,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 15:25:46,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:46,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 15:25:46,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1124, Unknown=4, NotChecked=0, Total=1260 [2025-03-03 15:25:46,708 INFO L87 Difference]: Start difference. First operand 741 states and 1111 transitions. Second operand has 31 states, 29 states have (on average 4.413793103448276) internal successors, (128), 29 states have internal predecessors, (128), 16 states have call successors, (56), 10 states have call predecessors, (56), 12 states have return successors, (56), 14 states have call predecessors, (56), 16 states have call successors, (56) [2025-03-03 15:25:48,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:51,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:55,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:57,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:59,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 15:26:03,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:26:06,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]