./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_peterson.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_peterson.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a8be7009a37d1df58713fd67cd9771c39e6139a0416009824ceb58da10928b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:51:59,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:51:59,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:51:59,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:51:59,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:51:59,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:51:59,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:51:59,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:51:59,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:51:59,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:51:59,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:51:59,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:51:59,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:51:59,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:51:59,922 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:51:59,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:51:59,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:51:59,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:51:59,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:51:59,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:51:59,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:51:59,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:59,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:51:59,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:51:59,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:51:59,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:51:59,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:51:59,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:51:59,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:51:59,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:51:59,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:51:59,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:51:59,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a8be7009a37d1df58713fd67cd9771c39e6139a0416009824ceb58da10928b7 [2025-02-05 16:52:00,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:52:00,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:52:00,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:52:00,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:52:00,215 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:52:00,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_peterson.i [2025-02-05 16:52:01,412 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcc38b8a5/863039336dc04088b113fc998b10fc1c/FLAG9dd3e3768 [2025-02-05 16:52:01,720 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:52:01,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i [2025-02-05 16:52:01,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcc38b8a5/863039336dc04088b113fc998b10fc1c/FLAG9dd3e3768 [2025-02-05 16:52:02,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcc38b8a5/863039336dc04088b113fc998b10fc1c [2025-02-05 16:52:02,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:52:02,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:52:02,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:02,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:52:02,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:52:02,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12fdff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02, skipping insertion in model container [2025-02-05 16:52:02,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:52:02,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i[23605,23618] [2025-02-05 16:52:02,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:02,341 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:52:02,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i[23605,23618] [2025-02-05 16:52:02,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:52:02,441 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:52:02,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02 WrapperNode [2025-02-05 16:52:02,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:52:02,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:02,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:52:02,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:52:02,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,494 INFO L138 Inliner]: procedures = 145, calls = 285, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 437 [2025-02-05 16:52:02,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:52:02,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:52:02,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:52:02,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:52:02,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,542 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 5, 8, 8, 5, 8, 29, 21, 7, 7, 7, 7, 13, 5, 6, 13, 0, 5]. 19 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 0, 3, 3, 0, 3, 9, 9, 3, 3, 3, 3, 0, 0, 2, 0, 0, 0]. The 39 writes are split as follows [0, 1, 2, 2, 1, 2, 11, 6, 2, 2, 2, 2, 1, 1, 2, 1, 0, 1]. [2025-02-05 16:52:02,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:52:02,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:52:02,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:52:02,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:52:02,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (1/1) ... [2025-02-05 16:52:02,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:52:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:02,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:52:02,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:52:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:52:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:52:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:52:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:52:02,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:52:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:52:02,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:52:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-05 16:52:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:52:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:02,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-05 16:52:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:52:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:52:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:52:02,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:52:02,891 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:52:02,893 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:52:07,375 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-02-05 16:52:07,375 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:52:07,383 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:52:07,383 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:52:07,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:07 BoogieIcfgContainer [2025-02-05 16:52:07,384 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:52:07,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:52:07,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:52:07,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:52:07,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:52:02" (1/3) ... [2025-02-05 16:52:07,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8119e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:07, skipping insertion in model container [2025-02-05 16:52:07,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:52:02" (2/3) ... [2025-02-05 16:52:07,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8119e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:07, skipping insertion in model container [2025-02-05 16:52:07,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:07" (3/3) ... [2025-02-05 16:52:07,392 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_peterson.i [2025-02-05 16:52:07,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:52:07,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_peterson.i that has 6 procedures, 110 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 16:52:07,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:52:07,462 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;@2a97acc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:52:07,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:52:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 16:52:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:52:07,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:07,475 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:07,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:07,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2104813846, now seen corresponding path program 1 times [2025-02-05 16:52:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469970892] [2025-02-05 16:52:07,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:07,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:52:07,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:52:07,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:07,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:52:08,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:08,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469970892] [2025-02-05 16:52:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469970892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:08,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:08,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128480676] [2025-02-05 16:52:08,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:08,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:08,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:08,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:08,157 INFO L87 Difference]: Start difference. First operand has 110 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:52:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:08,459 INFO L93 Difference]: Finished difference Result 218 states and 346 transitions. [2025-02-05 16:52:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-02-05 16:52:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:08,467 INFO L225 Difference]: With dead ends: 218 [2025-02-05 16:52:08,467 INFO L226 Difference]: Without dead ends: 108 [2025-02-05 16:52:08,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:08,476 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:08,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:52:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-05 16:52:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-02-05 16:52:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 16:52:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-02-05 16:52:08,521 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 131 [2025-02-05 16:52:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:08,521 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-02-05 16:52:08,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:52:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-02-05 16:52:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 16:52:08,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:08,528 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:08,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:52:08,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1669982184, now seen corresponding path program 1 times [2025-02-05 16:52:08,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42602946] [2025-02-05 16:52:08,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:08,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 16:52:08,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 16:52:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:52:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42602946] [2025-02-05 16:52:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42602946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:08,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:08,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190120386] [2025-02-05 16:52:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:08,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:08,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:08,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:08,814 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:52:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:08,850 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2025-02-05 16:52:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:08,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-02-05 16:52:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:08,852 INFO L225 Difference]: With dead ends: 212 [2025-02-05 16:52:08,852 INFO L226 Difference]: Without dead ends: 108 [2025-02-05 16:52:08,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:08,853 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 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-02-05 16:52:08,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-05 16:52:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-05 16:52:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 16:52:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-02-05 16:52:08,869 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 133 [2025-02-05 16:52:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:08,869 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-02-05 16:52:08,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:52:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-02-05 16:52:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:52:08,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:08,873 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:52:08,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:08,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 910353227, now seen corresponding path program 1 times [2025-02-05 16:52:08,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:08,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68033494] [2025-02-05 16:52:08,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:08,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:52:08,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:52:08,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:08,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:52:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68033494] [2025-02-05 16:52:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68033494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114361962] [2025-02-05 16:52:09,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:09,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:09,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:09,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:52:09,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:52:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:52:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:09,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:09,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:52:09,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:52:09,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:52:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114361962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:09,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:09,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:52:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699079160] [2025-02-05 16:52:09,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:09,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:52:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:09,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:52:09,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:09,669 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:52:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:09,708 INFO L93 Difference]: Finished difference Result 215 states and 309 transitions. [2025-02-05 16:52:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:52:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 134 [2025-02-05 16:52:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:09,713 INFO L225 Difference]: With dead ends: 215 [2025-02-05 16:52:09,713 INFO L226 Difference]: Without dead ends: 110 [2025-02-05 16:52:09,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 265 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-02-05 16:52:09,714 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:09,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-05 16:52:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-05 16:52:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 16:52:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-02-05 16:52:09,728 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 134 [2025-02-05 16:52:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:09,729 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-02-05 16:52:09,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:52:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-02-05 16:52:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:52:09,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:09,732 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:09,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:09,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:09,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:09,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 802572523, now seen corresponding path program 2 times [2025-02-05 16:52:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811911795] [2025-02-05 16:52:09,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:10,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-02-05 16:52:10,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 136 statements. [2025-02-05 16:52:10,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-02-05 16:52:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811911795] [2025-02-05 16:52:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811911795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:10,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915930007] [2025-02-05 16:52:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:10,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:10,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:10,207 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:52:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:10,240 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-02-05 16:52:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:10,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-02-05 16:52:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:10,244 INFO L225 Difference]: With dead ends: 210 [2025-02-05 16:52:10,246 INFO L226 Difference]: Without dead ends: 164 [2025-02-05 16:52:10,247 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-02-05 16:52:10,247 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 472 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-02-05 16:52:10,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 472 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-05 16:52:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-05 16:52:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2025-02-05 16:52:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 235 transitions. [2025-02-05 16:52:10,263 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 235 transitions. Word has length 136 [2025-02-05 16:52:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 235 transitions. [2025-02-05 16:52:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:52:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 235 transitions. [2025-02-05 16:52:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 16:52:10,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:10,265 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:10,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:52:10,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:10,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1968901276, now seen corresponding path program 1 times [2025-02-05 16:52:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:10,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581198314] [2025-02-05 16:52:10,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:10,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 16:52:10,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 16:52:10,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:10,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-02-05 16:52:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581198314] [2025-02-05 16:52:10,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581198314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200396873] [2025-02-05 16:52:10,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:10,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:10,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:10,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:10,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:52:10,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 16:52:11,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 16:52:11,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:11,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:11,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:52:11,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-02-05 16:52:11,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-02-05 16:52:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200396873] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:11,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:11,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:52:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611792285] [2025-02-05 16:52:11,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:11,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:52:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:11,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:52:11,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:11,263 INFO L87 Difference]: Start difference. First operand 164 states and 235 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-02-05 16:52:15,308 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-02-05 16:52:17,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:17,803 INFO L93 Difference]: Finished difference Result 330 states and 474 transitions. [2025-02-05 16:52:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:52:17,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 205 [2025-02-05 16:52:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:17,808 INFO L225 Difference]: With dead ends: 330 [2025-02-05 16:52:17,808 INFO L226 Difference]: Without dead ends: 174 [2025-02-05 16:52:17,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 407 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-02-05 16:52:17,809 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 2 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:17,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 443 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2025-02-05 16:52:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-05 16:52:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-02-05 16:52:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2025-02-05 16:52:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2025-02-05 16:52:17,821 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 205 [2025-02-05 16:52:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:17,821 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2025-02-05 16:52:17,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-02-05 16:52:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2025-02-05 16:52:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 16:52:17,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:17,823 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:17,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:18,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:18,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:18,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1497019972, now seen corresponding path program 2 times [2025-02-05 16:52:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:18,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344339561] [2025-02-05 16:52:18,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:18,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-02-05 16:52:18,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 215 statements. [2025-02-05 16:52:18,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:18,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-02-05 16:52:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344339561] [2025-02-05 16:52:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344339561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:18,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:18,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590371335] [2025-02-05 16:52:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:18,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:18,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:18,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:18,290 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 16:52:22,302 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-02-05 16:52:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:22,763 INFO L93 Difference]: Finished difference Result 460 states and 661 transitions. [2025-02-05 16:52:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 215 [2025-02-05 16:52:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:22,766 INFO L225 Difference]: With dead ends: 460 [2025-02-05 16:52:22,766 INFO L226 Difference]: Without dead ends: 320 [2025-02-05 16:52:22,767 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-02-05 16:52:22,767 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 136 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:22,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 631 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-05 16:52:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-05 16:52:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2025-02-05 16:52:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 204 states have (on average 1.2794117647058822) internal successors, (261), 204 states have internal predecessors, (261), 91 states have call successors, (91), 20 states have call predecessors, (91), 20 states have return successors, (106), 91 states have call predecessors, (106), 91 states have call successors, (106) [2025-02-05 16:52:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 458 transitions. [2025-02-05 16:52:22,793 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 458 transitions. Word has length 215 [2025-02-05 16:52:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:22,793 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 458 transitions. [2025-02-05 16:52:22,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 16:52:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 458 transitions. [2025-02-05 16:52:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 16:52:22,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:22,801 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:22,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:52:22,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:22,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2074905990, now seen corresponding path program 1 times [2025-02-05 16:52:22,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:22,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304410936] [2025-02-05 16:52:22,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:22,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 16:52:22,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 16:52:22,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:22,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-02-05 16:52:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304410936] [2025-02-05 16:52:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304410936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010680533] [2025-02-05 16:52:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:23,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:23,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:23,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:23,410 INFO L87 Difference]: Start difference. First operand 316 states and 458 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 16:52:28,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:28,433 INFO L93 Difference]: Finished difference Result 578 states and 825 transitions. [2025-02-05 16:52:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:28,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 215 [2025-02-05 16:52:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:28,438 INFO L225 Difference]: With dead ends: 578 [2025-02-05 16:52:28,438 INFO L226 Difference]: Without dead ends: 290 [2025-02-05 16:52:28,438 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-02-05 16:52:28,439 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 132 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:28,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 635 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-02-05 16:52:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-05 16:52:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2025-02-05 16:52:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 185 states have internal predecessors, (229), 82 states have call successors, (82), 18 states have call predecessors, (82), 18 states have return successors, (90), 82 states have call predecessors, (90), 82 states have call successors, (90) [2025-02-05 16:52:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 401 transitions. [2025-02-05 16:52:28,469 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 401 transitions. Word has length 215 [2025-02-05 16:52:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:28,470 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 401 transitions. [2025-02-05 16:52:28,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 16:52:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 401 transitions. [2025-02-05 16:52:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 16:52:28,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:28,474 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:28,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:52:28,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:28,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1273261816, now seen corresponding path program 1 times [2025-02-05 16:52:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:28,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124054748] [2025-02-05 16:52:28,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:28,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 16:52:28,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 16:52:28,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:28,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-02-05 16:52:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:29,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124054748] [2025-02-05 16:52:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124054748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50267772] [2025-02-05 16:52:29,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:29,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:29,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:29,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:29,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:52:29,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 16:52:29,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 16:52:29,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:29,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:29,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1739 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:52:29,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-02-05 16:52:29,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-02-05 16:52:30,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50267772] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:30,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:30,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-05 16:52:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917335767] [2025-02-05 16:52:30,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:30,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:52:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:30,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:52:30,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:52:30,033 INFO L87 Difference]: Start difference. First operand 286 states and 401 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) [2025-02-05 16:52:35,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:36,559 INFO L93 Difference]: Finished difference Result 574 states and 818 transitions. [2025-02-05 16:52:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:52:36,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) Word has length 215 [2025-02-05 16:52:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:36,562 INFO L225 Difference]: With dead ends: 574 [2025-02-05 16:52:36,562 INFO L226 Difference]: Without dead ends: 312 [2025-02-05 16:52:36,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 429 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-02-05 16:52:36,564 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:36,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 713 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 612 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2025-02-05 16:52:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-05 16:52:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2025-02-05 16:52:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 207 states have internal predecessors, (258), 75 states have call successors, (75), 26 states have call predecessors, (75), 28 states have return successors, (95), 75 states have call predecessors, (95), 75 states have call successors, (95) [2025-02-05 16:52:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2025-02-05 16:52:36,580 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 215 [2025-02-05 16:52:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2025-02-05 16:52:36,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) [2025-02-05 16:52:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2025-02-05 16:52:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 16:52:36,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:36,583 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 9, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:36,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:52:36,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:36,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:36,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1306280632, now seen corresponding path program 1 times [2025-02-05 16:52:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136859266] [2025-02-05 16:52:36,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:36,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 16:52:36,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 16:52:36,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:36,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-02-05 16:52:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136859266] [2025-02-05 16:52:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136859266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231005895] [2025-02-05 16:52:38,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:38,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:38,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:52:38,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 16:52:39,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 16:52:39,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:39,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:39,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-05 16:52:39,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:39,233 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-02-05 16:52:46,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 16:52:46,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 16:52:46,462 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-02-05 16:52:47,493 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-02-05 16:52:47,494 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-02-05 16:53:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 365 proven. 4 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-02-05 16:53:10,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:10,924 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-02-05 16:53:10,930 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-02-05 16:53:11,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 16:53:11,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-05 16:53:11,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 16:53:11,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-05 16:53:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-02-05 16:53:11,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231005895] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:11,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:11,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-02-05 16:53:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814120869] [2025-02-05 16:53:11,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:11,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-05 16:53:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:11,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-05 16:53:11,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1252, Unknown=2, NotChecked=0, Total=1406 [2025-02-05 16:53:11,562 INFO L87 Difference]: Start difference. First operand 309 states and 428 transitions. Second operand has 38 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 19 states have call successors, (68), 12 states have call predecessors, (68), 14 states have return successors, (68), 17 states have call predecessors, (68), 19 states have call successors, (68) [2025-02-05 16:53:14,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:18,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:22,474 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-02-05 16:53:26,483 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-02-05 16:53:31,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:33,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:37,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:38,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []