./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee7ff83d9ca4f9baaadd009c98a7dd30697b6140296199117a6b05757b5b9f74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:34:16,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:34:17,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:34:17,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:34:17,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:34:17,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:34:17,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:34:17,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:34:17,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:34:17,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:34:17,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:34:17,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:34:17,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:34:17,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:34:17,076 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:34:17,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:34:17,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:34:17,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:34:17,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:34:17,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:34:17,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:34:17,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:34:17,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:34:17,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:17,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:34:17,079 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee7ff83d9ca4f9baaadd009c98a7dd30697b6140296199117a6b05757b5b9f74 [2025-03-08 06:34:17,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:34:17,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:34:17,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:34:17,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:34:17,329 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:34:17,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i [2025-03-08 06:34:18,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d719044/5d332433b11b419e8b90d0111b6b5d49/FLAGb2cc5d037 [2025-03-08 06:34:18,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:34:18,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i [2025-03-08 06:34:18,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d719044/5d332433b11b419e8b90d0111b6b5d49/FLAGb2cc5d037 [2025-03-08 06:34:18,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d719044/5d332433b11b419e8b90d0111b6b5d49 [2025-03-08 06:34:18,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:34:18,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:34:18,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:18,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:34:18,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:34:18,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:18" (1/1) ... [2025-03-08 06:34:18,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67074860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:18, skipping insertion in model container [2025-03-08 06:34:18,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:34:18" (1/1) ... [2025-03-08 06:34:18,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:34:19,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i[23603,23616] [2025-03-08 06:34:19,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:19,271 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:34:19,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i[23603,23616] [2025-03-08 06:34:19,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:34:19,380 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:34:19,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19 WrapperNode [2025-03-08 06:34:19,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:34:19,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:19,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:34:19,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:34:19,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,452 INFO L138 Inliner]: procedures = 145, calls = 309, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 457 [2025-03-08 06:34:19,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:34:19,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:34:19,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:34:19,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:34:19,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,507 INFO L175 MemorySlicer]: Split 158 memory accesses to 18 slices as follows [2, 8, 8, 8, 29, 21, 7, 5, 7, 9, 7, 5, 5, 0, 13, 6, 5, 13]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 3, 3, 3, 9, 9, 3, 0, 3, 3, 3, 0, 0, 0, 0, 2, 0, 0]. The 39 writes are split as follows [0, 2, 2, 2, 11, 6, 2, 1, 2, 2, 2, 1, 1, 0, 1, 2, 1, 1]. [2025-03-08 06:34:19,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:34:19,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:34:19,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:34:19,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:34:19,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (1/1) ... [2025-03-08 06:34:19,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:34:19,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:19,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:34:19,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:34:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:34:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:34:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:34:19,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:34:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:34:19,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:34:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:34:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:34:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:34:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:34:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:34:19,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:34:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:34:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 06:34:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:34:19,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:34:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:19,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:34:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:34:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:34:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 06:34:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:34:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:34:19,861 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:34:19,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:34:21,179 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-08 06:34:21,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:34:21,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:34:21,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:34:21,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:21 BoogieIcfgContainer [2025-03-08 06:34:21,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:34:21,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:34:21,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:34:21,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:34:21,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:34:18" (1/3) ... [2025-03-08 06:34:21,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f190392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:21, skipping insertion in model container [2025-03-08 06:34:21,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:34:19" (2/3) ... [2025-03-08 06:34:21,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f190392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:34:21, skipping insertion in model container [2025-03-08 06:34:21,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:34:21" (3/3) ... [2025-03-08 06:34:21,201 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_dekker_unfair.i [2025-03-08 06:34:21,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:34:21,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_dekker_unfair.i that has 6 procedures, 116 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 06:34:21,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:34:21,262 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;@3a484de1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:34:21,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:34:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 06:34:21,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:21,274 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-03-08 06:34:21,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash 499045430, now seen corresponding path program 1 times [2025-03-08 06:34:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625428316] [2025-03-08 06:34:21,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:21,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 06:34:21,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 06:34:21,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:21,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625428316] [2025-03-08 06:34:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625428316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:21,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:21,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484884329] [2025-03-08 06:34:21,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:21,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:21,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:21,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:21,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:21,949 INFO L87 Difference]: Start difference. First operand has 116 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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-03-08 06:34:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:22,618 INFO L93 Difference]: Finished difference Result 230 states and 367 transitions. [2025-03-08 06:34:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:22,620 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-03-08 06:34:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:22,627 INFO L225 Difference]: With dead ends: 230 [2025-03-08 06:34:22,627 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 06:34:22,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:22,634 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:22,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:34:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 06:34:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-08 06:34:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-03-08 06:34:22,682 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 131 [2025-03-08 06:34:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:22,682 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-03-08 06:34:22,683 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-03-08 06:34:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-03-08 06:34:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 06:34:22,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:22,688 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-03-08 06:34:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:34:22,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 552625124, now seen corresponding path program 1 times [2025-03-08 06:34:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566721227] [2025-03-08 06:34:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:22,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 06:34:22,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 06:34:22,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:22,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566721227] [2025-03-08 06:34:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566721227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:34:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811241282] [2025-03-08 06:34:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:23,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:34:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:23,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:34:23,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:23,008 INFO L87 Difference]: Start difference. First operand 113 states and 163 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-03-08 06:34:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:23,037 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2025-03-08 06:34:23,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:34:23,040 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-03-08 06:34:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:23,042 INFO L225 Difference]: With dead ends: 224 [2025-03-08 06:34:23,042 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 06:34:23,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:34:23,043 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:23,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:34:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 06:34:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-08 06:34:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-08 06:34:23,053 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 133 [2025-03-08 06:34:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:23,053 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-08 06:34:23,053 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-03-08 06:34:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-08 06:34:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 06:34:23,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:23,055 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-03-08 06:34:23,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:34:23,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:23,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2018252427, now seen corresponding path program 1 times [2025-03-08 06:34:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:23,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550453426] [2025-03-08 06:34:23,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:23,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:34:23,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:34:23,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:23,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550453426] [2025-03-08 06:34:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550453426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082232342] [2025-03-08 06:34:23,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:23,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:23,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:23,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:34:23,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:34:23,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 06:34:23,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 06:34:23,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:23,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:23,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:34:23,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:23,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 06:34:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082232342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:23,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:23,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:34:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342048593] [2025-03-08 06:34:23,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:23,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:34:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:23,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:34:23,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:23,928 INFO L87 Difference]: Start difference. First operand 114 states and 164 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-03-08 06:34:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:23,968 INFO L93 Difference]: Finished difference Result 227 states and 329 transitions. [2025-03-08 06:34:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:34:23,969 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-03-08 06:34:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:23,972 INFO L225 Difference]: With dead ends: 227 [2025-03-08 06:34:23,972 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 06:34:23,973 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-03-08 06:34:23,974 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:23,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:34:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 06:34:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-08 06:34:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 06:34:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-08 06:34:23,984 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 134 [2025-03-08 06:34:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:23,984 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-08 06:34:23,985 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-03-08 06:34:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-08 06:34:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 06:34:23,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:23,988 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-03-08 06:34:23,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:34:24,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:24,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -73376341, now seen corresponding path program 2 times [2025-03-08 06:34:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833738005] [2025-03-08 06:34:24,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:34:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:24,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-03-08 06:34:24,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 136 statements. [2025-03-08 06:34:24,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:34:24,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-03-08 06:34:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833738005] [2025-03-08 06:34:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833738005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:24,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:34:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639886192] [2025-03-08 06:34:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:24,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:34:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:24,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:34:24,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:34:24,476 INFO L87 Difference]: Start difference. First operand 116 states and 166 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-03-08 06:34:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:24,503 INFO L93 Difference]: Finished difference Result 222 states and 323 transitions. [2025-03-08 06:34:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:34:24,504 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-03-08 06:34:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:24,507 INFO L225 Difference]: With dead ends: 222 [2025-03-08 06:34:24,507 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 06:34:24,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:34:24,508 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 107 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:24,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 502 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:34:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 06:34:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-08 06:34:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 116 states have internal predecessors, (153), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-08 06:34:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2025-03-08 06:34:24,521 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 136 [2025-03-08 06:34:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:24,522 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2025-03-08 06:34:24,522 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-03-08 06:34:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2025-03-08 06:34:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 06:34:24,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:24,524 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:24,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:34:24,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:24,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash 164353855, now seen corresponding path program 1 times [2025-03-08 06:34:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809159130] [2025-03-08 06:34:24,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:24,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 06:34:24,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 06:34:24,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:24,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-03-08 06:34:24,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:24,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809159130] [2025-03-08 06:34:24,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809159130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:24,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479262096] [2025-03-08 06:34:24,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:24,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:24,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:24,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:34:24,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:34:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 06:34:25,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 06:34:25,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:25,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:25,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:34:25,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-03-08 06:34:25,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-03-08 06:34:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479262096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:25,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:25,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:34:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638477014] [2025-03-08 06:34:25,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:25,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:34:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:25,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:34:25,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:25,547 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 06:34:27,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:34:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:27,686 INFO L93 Difference]: Finished difference Result 354 states and 514 transitions. [2025-03-08 06:34:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:34:27,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 220 [2025-03-08 06:34:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:27,690 INFO L225 Difference]: With dead ends: 354 [2025-03-08 06:34:27,690 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 06:34:27,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:34:27,691 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:27,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 316 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 06:34:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 06:34:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-08 06:34:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 126 states have internal predecessors, (165), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-03-08 06:34:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2025-03-08 06:34:27,716 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 220 [2025-03-08 06:34:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:27,716 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2025-03-08 06:34:27,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 06:34:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2025-03-08 06:34:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:27,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:27,722 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:27,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:34:27,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:27,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:27,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash -389956193, now seen corresponding path program 2 times [2025-03-08 06:34:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112692059] [2025-03-08 06:34:27,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:34:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:28,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 230 statements into 2 equivalence classes. [2025-03-08 06:34:28,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 230 statements. [2025-03-08 06:34:28,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:34:28,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 06:34:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112692059] [2025-03-08 06:34:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112692059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:34:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358333532] [2025-03-08 06:34:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:28,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:34:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:28,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:34:28,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:34:28,248 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:32,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:34:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:33,273 INFO L93 Difference]: Finished difference Result 496 states and 721 transitions. [2025-03-08 06:34:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:34:33,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 230 [2025-03-08 06:34:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:33,277 INFO L225 Difference]: With dead ends: 496 [2025-03-08 06:34:33,277 INFO L226 Difference]: Without dead ends: 344 [2025-03-08 06:34:33,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:34:33,278 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 146 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:33,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 661 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 06:34:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-08 06:34:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2025-03-08 06:34:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 224 states have (on average 1.3080357142857142) internal successors, (293), 224 states have internal predecessors, (293), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-03-08 06:34:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 498 transitions. [2025-03-08 06:34:33,307 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 498 transitions. Word has length 230 [2025-03-08 06:34:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:33,307 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 498 transitions. [2025-03-08 06:34:33,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 498 transitions. [2025-03-08 06:34:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:33,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:33,310 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:33,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:34:33,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:33,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1068275201, now seen corresponding path program 1 times [2025-03-08 06:34:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178754114] [2025-03-08 06:34:33,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:33,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:33,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:33,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:33,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-08 06:34:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178754114] [2025-03-08 06:34:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178754114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:34:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:34:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433977054] [2025-03-08 06:34:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:34:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:33,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:34:33,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:34:33,988 INFO L87 Difference]: Start difference. First operand 340 states and 498 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:35,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:34:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:36,671 INFO L93 Difference]: Finished difference Result 620 states and 895 transitions. [2025-03-08 06:34:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:34:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 230 [2025-03-08 06:34:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:36,673 INFO L225 Difference]: With dead ends: 620 [2025-03-08 06:34:36,673 INFO L226 Difference]: Without dead ends: 308 [2025-03-08 06:34:36,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:34:36,675 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 142 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:36,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 665 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 06:34:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-08 06:34:36,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2025-03-08 06:34:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 200 states have (on average 1.26) internal successors, (252), 200 states have internal predecessors, (252), 85 states have call successors, (85), 18 states have call predecessors, (85), 18 states have return successors, (93), 85 states have call predecessors, (93), 85 states have call successors, (93) [2025-03-08 06:34:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2025-03-08 06:34:36,698 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 230 [2025-03-08 06:34:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:36,698 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2025-03-08 06:34:36,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 06:34:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2025-03-08 06:34:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:36,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:36,701 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:36,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:34:36,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:36,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1605607998, now seen corresponding path program 1 times [2025-03-08 06:34:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:36,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231302717] [2025-03-08 06:34:36,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:36,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:36,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:36,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:36,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:37,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231302717] [2025-03-08 06:34:37,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231302717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:37,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571416279] [2025-03-08 06:34:37,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:37,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:37,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:37,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:34:37,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:34:37,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:37,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:37,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 06:34:37,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2025-03-08 06:34:37,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:34:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571416279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:34:37,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:34:37,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-08 06:34:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9866404] [2025-03-08 06:34:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:34:37,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:34:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:37,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:34:37,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:34:37,992 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 06:34:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:38,715 INFO L93 Difference]: Finished difference Result 811 states and 1140 transitions. [2025-03-08 06:34:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:34:38,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 230 [2025-03-08 06:34:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:38,720 INFO L225 Difference]: With dead ends: 811 [2025-03-08 06:34:38,720 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 06:34:38,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:34:38,722 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 258 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:38,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 483 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:34:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 06:34:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2025-03-08 06:34:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 328 states have (on average 1.1768292682926829) internal successors, (386), 327 states have internal predecessors, (386), 142 states have call successors, (142), 31 states have call predecessors, (142), 37 states have return successors, (170), 149 states have call predecessors, (170), 142 states have call successors, (170) [2025-03-08 06:34:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 698 transitions. [2025-03-08 06:34:38,762 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 698 transitions. Word has length 230 [2025-03-08 06:34:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:38,763 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 698 transitions. [2025-03-08 06:34:38,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 06:34:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 698 transitions. [2025-03-08 06:34:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:38,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:38,767 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:38,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:34:38,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:38,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1539527011, now seen corresponding path program 1 times [2025-03-08 06:34:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146070370] [2025-03-08 06:34:38,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:39,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:39,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:39,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:39,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:39,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146070370] [2025-03-08 06:34:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146070370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395275849] [2025-03-08 06:34:39,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:39,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:39,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:34:39,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:34:39,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:39,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:39,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:39,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:34:39,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 400 proven. 4 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-08 06:34:40,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:34:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395275849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:34:40,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:34:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 06:34:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145229749] [2025-03-08 06:34:40,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:34:40,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:34:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:34:40,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:34:40,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:34:40,464 INFO L87 Difference]: Start difference. First operand 508 states and 698 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) [2025-03-08 06:34:44,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:34:48,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:34:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:34:49,015 INFO L93 Difference]: Finished difference Result 1043 states and 1454 transitions. [2025-03-08 06:34:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:34:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) Word has length 230 [2025-03-08 06:34:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:34:49,020 INFO L225 Difference]: With dead ends: 1043 [2025-03-08 06:34:49,020 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 06:34:49,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:34:49,022 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 214 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 137 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:34:49,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 505 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 379 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-08 06:34:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 06:34:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 546. [2025-03-08 06:34:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 364 states have (on average 1.2087912087912087) internal successors, (440), 364 states have internal predecessors, (440), 126 states have call successors, (126), 44 states have call predecessors, (126), 55 states have return successors, (180), 137 states have call predecessors, (180), 126 states have call successors, (180) [2025-03-08 06:34:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 746 transitions. [2025-03-08 06:34:49,053 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 746 transitions. Word has length 230 [2025-03-08 06:34:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:34:49,053 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 746 transitions. [2025-03-08 06:34:49,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) [2025-03-08 06:34:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 746 transitions. [2025-03-08 06:34:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:34:49,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:34:49,056 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:34:49,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:34:49,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:49,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:34:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:34:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1506508195, now seen corresponding path program 1 times [2025-03-08 06:34:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:34:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240435959] [2025-03-08 06:34:49,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:34:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:49,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:49,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:49,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:34:50,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:34:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240435959] [2025-03-08 06:34:50,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240435959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:34:50,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589634629] [2025-03-08 06:34:50,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:34:50,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:34:50,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:34:50,805 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:34:50,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:34:51,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:34:51,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:34:51,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:34:51,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:34:51,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1868 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 06:34:51,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:34:51,494 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 15 treesize of output 11 [2025-03-08 06:34:56,284 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-08 06:34:56,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 15 [2025-03-08 06:34:57,524 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2025-03-08 06:34:57,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-03-08 06:35:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 472 proven. 4 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-03-08 06:35:23,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:23,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-03-08 06:35:23,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-08 06:35:23,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 06:35:23,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-08 06:35:23,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 06:35:23,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-08 06:35:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-03-08 06:35:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589634629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:23,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:23,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 34 [2025-03-08 06:35:23,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625812486] [2025-03-08 06:35:23,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:23,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 06:35:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:23,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 06:35:23,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 06:35:23,993 INFO L87 Difference]: Start difference. First operand 546 states and 746 transitions. Second operand has 34 states, 32 states have (on average 4.40625) internal successors, (141), 32 states have internal predecessors, (141), 16 states have call successors, (69), 10 states have call predecessors, (69), 13 states have return successors, (70), 15 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-08 06:35:28,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:35,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:39,801 INFO L93 Difference]: Finished difference Result 1127 states and 1598 transitions. [2025-03-08 06:35:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 06:35:39,801 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 4.40625) internal successors, (141), 32 states have internal predecessors, (141), 16 states have call successors, (69), 10 states have call predecessors, (69), 13 states have return successors, (70), 15 states have call predecessors, (70), 16 states have call successors, (70) Word has length 230 [2025-03-08 06:35:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:39,805 INFO L225 Difference]: With dead ends: 1127 [2025-03-08 06:35:39,805 INFO L226 Difference]: Without dead ends: 651 [2025-03-08 06:35:39,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 440 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=616, Invalid=3166, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 06:35:39,808 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 749 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 704 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 3052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:39,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1563 Invalid, 3052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 2346 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2025-03-08 06:35:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-08 06:35:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 596. [2025-03-08 06:35:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 393 states have (on average 1.2010178117048347) internal successors, (472), 392 states have internal predecessors, (472), 142 states have call successors, (142), 44 states have call predecessors, (142), 60 states have return successors, (232), 159 states have call predecessors, (232), 142 states have call successors, (232) [2025-03-08 06:35:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2025-03-08 06:35:39,862 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 230 [2025-03-08 06:35:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:39,862 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2025-03-08 06:35:39,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 4.40625) internal successors, (141), 32 states have internal predecessors, (141), 16 states have call successors, (69), 10 states have call predecessors, (69), 13 states have return successors, (70), 15 states have call predecessors, (70), 16 states have call successors, (70) [2025-03-08 06:35:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2025-03-08 06:35:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-08 06:35:39,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:39,865 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:39,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 06:35:40,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 06:35:40,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:40,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:40,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1435016697, now seen corresponding path program 1 times [2025-03-08 06:35:40,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928200650] [2025-03-08 06:35:40,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:40,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:40,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-08 06:35:40,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-08 06:35:40,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:40,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-08 06:35:41,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:41,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928200650] [2025-03-08 06:35:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928200650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:35:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738239124] [2025-03-08 06:35:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:35:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:35:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:35:41,527 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 6 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-08 06:35:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:42,485 INFO L93 Difference]: Finished difference Result 1351 states and 1890 transitions. [2025-03-08 06:35:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:35:42,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 6 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) Word has length 251 [2025-03-08 06:35:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:42,490 INFO L225 Difference]: With dead ends: 1351 [2025-03-08 06:35:42,490 INFO L226 Difference]: Without dead ends: 838 [2025-03-08 06:35:42,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-08 06:35:42,492 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 431 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:42,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 333 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:35:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-08 06:35:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 671. [2025-03-08 06:35:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 440 states have (on average 1.1863636363636363) internal successors, (522), 441 states have internal predecessors, (522), 163 states have call successors, (163), 47 states have call predecessors, (163), 67 states have return successors, (274), 182 states have call predecessors, (274), 163 states have call successors, (274) [2025-03-08 06:35:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 959 transitions. [2025-03-08 06:35:42,557 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 959 transitions. Word has length 251 [2025-03-08 06:35:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:42,558 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 959 transitions. [2025-03-08 06:35:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 6 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-08 06:35:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 959 transitions. [2025-03-08 06:35:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 06:35:42,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:42,561 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:35:42,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:35:42,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:42,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1442498054, now seen corresponding path program 1 times [2025-03-08 06:35:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368885618] [2025-03-08 06:35:42,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:42,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 06:35:42,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 06:35:42,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:42,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1880 trivial. 0 not checked. [2025-03-08 06:35:43,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:43,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368885618] [2025-03-08 06:35:43,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368885618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:43,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247282117] [2025-03-08 06:35:43,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:43,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:43,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:43,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:35:43,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:35:44,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 06:35:44,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 06:35:44,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:44,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:44,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 2389 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 06:35:44,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:44,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 06:35:44,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:35:44,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 06:35:45,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 06:35:45,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:35:45,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 06:35:45,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:35:45,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 06:35:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 548 proven. 33 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-03-08 06:35:45,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2025-03-08 06:35:46,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247282117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:46,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:46,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2025-03-08 06:35:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998229821] [2025-03-08 06:35:46,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:46,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 06:35:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:46,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 06:35:46,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2025-03-08 06:35:46,359 INFO L87 Difference]: Start difference. First operand 671 states and 959 transitions. Second operand has 31 states, 30 states have (on average 7.333333333333333) internal successors, (220), 31 states have internal predecessors, (220), 23 states have call successors, (93), 13 states have call predecessors, (93), 12 states have return successors, (93), 21 states have call predecessors, (93), 23 states have call successors, (93)