./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-1.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_stack-1.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 f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:35:04,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:35:04,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:35:04,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:35:04,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:35:04,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:35:04,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:35:04,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:35:04,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:35:04,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:35:04,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:35:04,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:35:04,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:35:04,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:35:04,557 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:35:04,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:35:04,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:35:04,557 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:35:04,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:35:04,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:35:04,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:35:04,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:35:04,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:35:04,561 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 -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2025-03-08 06:35:04,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:35:04,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:35:04,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:35:04,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:35:04,775 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:35:04,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-03-08 06:35:05,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427e430ba/480a84758e0948f48d0826363f11879c/FLAGd7d353614 [2025-03-08 06:35:06,111 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:35:06,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-03-08 06:35:06,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427e430ba/480a84758e0948f48d0826363f11879c/FLAGd7d353614 [2025-03-08 06:35:06,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427e430ba/480a84758e0948f48d0826363f11879c [2025-03-08 06:35:06,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:35:06,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:35:06,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:35:06,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:35:06,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:35:06,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:06,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa89fe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06, skipping insertion in model container [2025-03-08 06:35:06,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:06,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:35:06,760 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_stack-1.i[34744,34757] [2025-03-08 06:35:06,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:35:06,851 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:35:06,885 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_stack-1.i[34744,34757] [2025-03-08 06:35:06,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:35:06,968 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:35:06,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06 WrapperNode [2025-03-08 06:35:06,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:35:06,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:35:06,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:35:06,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:35:06,973 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:35:06" (1/1) ... [2025-03-08 06:35:06,991 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:35:06" (1/1) ... [2025-03-08 06:35:07,027 INFO L138 Inliner]: procedures = 254, calls = 303, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 681 [2025-03-08 06:35:07,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:35:07,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:35:07,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:35:07,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:35:07,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,075 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 8, 7, 8, 8, 20, 12, 12, 22, 4, 5, 21, 3, 0, 3, 7, 8, 6]. 14 percent of accesses are in the largest equivalence class. The 53 initializations are split as follows [2, 3, 0, 3, 3, 6, 6, 2, 10, 2, 2, 10, 0, 0, 0, 0, 2, 2]. The 38 writes are split as follows [0, 2, 1, 2, 2, 8, 3, 3, 6, 1, 1, 1, 1, 0, 1, 1, 3, 2]. [2025-03-08 06:35:07,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:35:07,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:35:07,139 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:35:07,140 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:35:07,141 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (1/1) ... [2025-03-08 06:35:07,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:35:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:07,165 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:35:07,171 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:35:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 06:35:07,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 06:35:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 06:35:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-08 06:35:07,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 06:35:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 06:35:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-08 06:35:07,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 06:35:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 06:35:07,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-03-08 06:35:07,192 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-08 06:35:07,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-08 06:35:07,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:35:07,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-08 06:35:07,192 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:35:07,192 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-08 06:35:07,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 06:35:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:35:07,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:35:07,389 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:35:07,391 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:35:07,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-03-08 06:35:07,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L955-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc #t~mem53; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: havoc pop_#t~ret60#1;havoc pop_#t~mem61#1; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L972-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,821 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1007-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,822 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-03-08 06:35:07,822 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,822 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,862 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-08 06:35:07,862 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,862 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L937-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L935-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L931: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L931: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-08 06:35:07,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L931-1: SUMMARY for call __CS_cs(); srcloc: null [2025-03-08 06:35:08,208 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-08 06:35:08,208 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:35:08,222 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:35:08,224 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:35:08,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:08 BoogieIcfgContainer [2025-03-08 06:35:08,224 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:35:08,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:35:08,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:35:08,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:35:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:35:06" (1/3) ... [2025-03-08 06:35:08,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a5b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:08, skipping insertion in model container [2025-03-08 06:35:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:35:06" (2/3) ... [2025-03-08 06:35:08,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a5b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:35:08, skipping insertion in model container [2025-03-08 06:35:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:35:08" (3/3) ... [2025-03-08 06:35:08,231 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2025-03-08 06:35:08,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:35:08,243 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-1.i that has 10 procedures, 216 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 06:35:08,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:35:08,300 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;@52e75aca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:35:08,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:35:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 132 states have (on average 1.5227272727272727) internal successors, (201), 135 states have internal predecessors, (201), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 06:35:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:35:08,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:08,320 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash 79501406, now seen corresponding path program 1 times [2025-03-08 06:35:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:08,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931703493] [2025-03-08 06:35:08,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:08,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:08,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:35:08,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:35:08,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:08,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 06:35:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931703493] [2025-03-08 06:35:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931703493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:08,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:08,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:08,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015004693] [2025-03-08 06:35:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:08,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:08,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:08,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:08,931 INFO L87 Difference]: Start difference. First operand has 216 states, 132 states have (on average 1.5227272727272727) internal successors, (201), 135 states have internal predecessors, (201), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 06:35:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:09,115 INFO L93 Difference]: Finished difference Result 430 states and 759 transitions. [2025-03-08 06:35:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:09,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-03-08 06:35:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:09,125 INFO L225 Difference]: With dead ends: 430 [2025-03-08 06:35:09,125 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 06:35:09,129 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:35:09,131 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 4 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:09,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 679 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:35:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 06:35:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2025-03-08 06:35:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 132 states have internal predecessors, (196), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 06:35:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 342 transitions. [2025-03-08 06:35:09,190 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 342 transitions. Word has length 95 [2025-03-08 06:35:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 342 transitions. [2025-03-08 06:35:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 06:35:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2025-03-08 06:35:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:35:09,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:09,198 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:35:09,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:09,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1510518610, now seen corresponding path program 1 times [2025-03-08 06:35:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:09,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281652844] [2025-03-08 06:35:09,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:35:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:35:09,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:09,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 06:35:09,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281652844] [2025-03-08 06:35:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281652844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:09,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:35:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980845342] [2025-03-08 06:35:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:09,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:35:09,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:09,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:35:09,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:35:09,453 INFO L87 Difference]: Start difference. First operand 213 states and 342 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 06:35:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:09,500 INFO L93 Difference]: Finished difference Result 425 states and 685 transitions. [2025-03-08 06:35:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:35:09,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-03-08 06:35:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:09,503 INFO L225 Difference]: With dead ends: 425 [2025-03-08 06:35:09,505 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 06:35:09,506 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:35:09,507 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:09,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 06:35:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-08 06:35:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 132 states have (on average 1.5) internal successors, (198), 134 states have internal predecessors, (198), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 06:35:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 344 transitions. [2025-03-08 06:35:09,527 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 344 transitions. Word has length 98 [2025-03-08 06:35:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:09,527 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 344 transitions. [2025-03-08 06:35:09,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 06:35:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 344 transitions. [2025-03-08 06:35:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:35:09,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:09,531 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:35:09,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:09,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash -915119826, now seen corresponding path program 1 times [2025-03-08 06:35:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:09,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851170841] [2025-03-08 06:35:09,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:09,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:35:09,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:35:09,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:09,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-08 06:35:09,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:09,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851170841] [2025-03-08 06:35:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851170841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126949469] [2025-03-08 06:35:09,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:09,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:09,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:09,802 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:35:09,803 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:35:10,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:35:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:35:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:10,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:35:10,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-08 06:35:10,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-08 06:35:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126949469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:10,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:10,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 06:35:10,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386976254] [2025-03-08 06:35:10,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:10,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:35:10,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:10,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:35:10,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:35:10,255 INFO L87 Difference]: Start difference. First operand 215 states and 344 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 06:35:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:10,308 INFO L93 Difference]: Finished difference Result 431 states and 693 transitions. [2025-03-08 06:35:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:35:10,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 100 [2025-03-08 06:35:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:10,313 INFO L225 Difference]: With dead ends: 431 [2025-03-08 06:35:10,314 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 06:35:10,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 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:35:10,315 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:10,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1009 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 06:35:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-08 06:35:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 136 states have (on average 1.4852941176470589) internal successors, (202), 138 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 06:35:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 348 transitions. [2025-03-08 06:35:10,337 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 348 transitions. Word has length 100 [2025-03-08 06:35:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:10,340 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 348 transitions. [2025-03-08 06:35:10,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 06:35:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 348 transitions. [2025-03-08 06:35:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:35:10,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:10,342 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 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] [2025-03-08 06:35:10,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:35:10,543 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:35:10,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:10,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -830595474, now seen corresponding path program 2 times [2025-03-08 06:35:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900078719] [2025-03-08 06:35:10,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:10,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-08 06:35:10,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 104 statements. [2025-03-08 06:35:10,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:10,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 06:35:10,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:10,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900078719] [2025-03-08 06:35:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900078719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:10,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:10,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:35:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403795379] [2025-03-08 06:35:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:10,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:35:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:10,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:35:10,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:35:10,779 INFO L87 Difference]: Start difference. First operand 219 states and 348 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 06:35:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:10,831 INFO L93 Difference]: Finished difference Result 424 states and 686 transitions. [2025-03-08 06:35:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:35:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2025-03-08 06:35:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:10,835 INFO L225 Difference]: With dead ends: 424 [2025-03-08 06:35:10,835 INFO L226 Difference]: Without dead ends: 390 [2025-03-08 06:35:10,836 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:35:10,838 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 294 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1055 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:35:10,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1055 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:35:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-08 06:35:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2025-03-08 06:35:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 239 states have (on average 1.5271966527196652) internal successors, (365), 243 states have internal predecessors, (365), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2025-03-08 06:35:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 635 transitions. [2025-03-08 06:35:10,865 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 635 transitions. Word has length 104 [2025-03-08 06:35:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:10,865 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 635 transitions. [2025-03-08 06:35:10,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 06:35:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 635 transitions. [2025-03-08 06:35:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 06:35:10,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:10,869 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 3, 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, 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:10,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:35:10,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:10,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash -531583238, now seen corresponding path program 1 times [2025-03-08 06:35:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884779562] [2025-03-08 06:35:10,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:10,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:10,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 06:35:10,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 06:35:10,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:10,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-08 06:35:11,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:11,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884779562] [2025-03-08 06:35:11,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884779562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:11,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757074375] [2025-03-08 06:35:11,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:11,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:11,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:11,119 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:35:11,121 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:35:11,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 06:35:11,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 06:35:11,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:11,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:11,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 06:35:11,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-03-08 06:35:11,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-03-08 06:35:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757074375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:11,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:11,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2025-03-08 06:35:11,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772959547] [2025-03-08 06:35:11,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:11,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:35:11,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:11,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:35:11,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:35:11,744 INFO L87 Difference]: Start difference. First operand 389 states and 635 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 06:35:15,885 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:19,895 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:35:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:19,918 INFO L93 Difference]: Finished difference Result 788 states and 1287 transitions. [2025-03-08 06:35:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:35:19,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 183 [2025-03-08 06:35:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:19,929 INFO L225 Difference]: With dead ends: 788 [2025-03-08 06:35:19,929 INFO L226 Difference]: Without dead ends: 402 [2025-03-08 06:35:19,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 366 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:35:19,934 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 12 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:19,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1339 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-08 06:35:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-08 06:35:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-03-08 06:35:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 252 states have (on average 1.507936507936508) internal successors, (380), 256 states have internal predecessors, (380), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2025-03-08 06:35:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 650 transitions. [2025-03-08 06:35:19,971 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 650 transitions. Word has length 183 [2025-03-08 06:35:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:19,972 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 650 transitions. [2025-03-08 06:35:19,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 06:35:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 650 transitions. [2025-03-08 06:35:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 06:35:19,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:19,975 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 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] [2025-03-08 06:35:19,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:35:20,176 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:35:20,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:20,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -304791912, now seen corresponding path program 2 times [2025-03-08 06:35:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963964286] [2025-03-08 06:35:20,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 06:35:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:20,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-03-08 06:35:20,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 196 statements. [2025-03-08 06:35:20,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 06:35:20,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-08 06:35:20,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963964286] [2025-03-08 06:35:20,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963964286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:20,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:20,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:20,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618977227] [2025-03-08 06:35:20,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:20,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:20,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:20,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:20,446 INFO L87 Difference]: Start difference. First operand 402 states and 650 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 06:35:24,457 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:35:28,576 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:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:28,839 INFO L93 Difference]: Finished difference Result 827 states and 1347 transitions. [2025-03-08 06:35:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:28,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 196 [2025-03-08 06:35:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:28,849 INFO L225 Difference]: With dead ends: 827 [2025-03-08 06:35:28,849 INFO L226 Difference]: Without dead ends: 789 [2025-03-08 06:35:28,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:28,851 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 396 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 52 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:28,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1405 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 103 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-08 06:35:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-08 06:35:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 782. [2025-03-08 06:35:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 481 states have (on average 1.5197505197505197) internal successors, (731), 492 states have internal predecessors, (731), 261 states have call successors, (261), 36 states have call predecessors, (261), 39 states have return successors, (293), 261 states have call predecessors, (293), 261 states have call successors, (293) [2025-03-08 06:35:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1285 transitions. [2025-03-08 06:35:28,925 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1285 transitions. Word has length 196 [2025-03-08 06:35:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:28,925 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1285 transitions. [2025-03-08 06:35:28,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 06:35:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1285 transitions. [2025-03-08 06:35:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 06:35:28,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:28,934 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 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] [2025-03-08 06:35:28,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:35:28,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 886885431, now seen corresponding path program 1 times [2025-03-08 06:35:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548640014] [2025-03-08 06:35:28,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:29,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 06:35:29,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 06:35:29,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:29,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-03-08 06:35:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548640014] [2025-03-08 06:35:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548640014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:29,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:29,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642653870] [2025-03-08 06:35:29,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:29,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:29,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:29,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:29,611 INFO L87 Difference]: Start difference. First operand 782 states and 1285 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 06:35:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:30,296 INFO L93 Difference]: Finished difference Result 1533 states and 2511 transitions. [2025-03-08 06:35:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 200 [2025-03-08 06:35:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:30,305 INFO L225 Difference]: With dead ends: 1533 [2025-03-08 06:35:30,305 INFO L226 Difference]: Without dead ends: 780 [2025-03-08 06:35:30,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:30,309 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 331 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:30,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1498 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:35:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-08 06:35:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770. [2025-03-08 06:35:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 475 states have (on average 1.5136842105263157) internal successors, (719), 487 states have internal predecessors, (719), 254 states have call successors, (254), 35 states have call predecessors, (254), 40 states have return successors, (283), 255 states have call predecessors, (283), 254 states have call successors, (283) [2025-03-08 06:35:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1256 transitions. [2025-03-08 06:35:30,365 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1256 transitions. Word has length 200 [2025-03-08 06:35:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:30,365 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1256 transitions. [2025-03-08 06:35:30,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 06:35:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1256 transitions. [2025-03-08 06:35:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 06:35:30,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:30,372 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 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] [2025-03-08 06:35:30,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:35:30,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:30,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2062460630, now seen corresponding path program 1 times [2025-03-08 06:35:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647683833] [2025-03-08 06:35:30,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:30,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 06:35:30,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 06:35:30,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:30,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-08 06:35:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647683833] [2025-03-08 06:35:30,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647683833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:30,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:30,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:30,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553036381] [2025-03-08 06:35:30,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:30,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:30,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:30,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:30,882 INFO L87 Difference]: Start difference. First operand 770 states and 1256 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 06:35:32,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 06:35:36,264 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:35:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:36,561 INFO L93 Difference]: Finished difference Result 1209 states and 1940 transitions. [2025-03-08 06:35:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:35:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 196 [2025-03-08 06:35:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:36,568 INFO L225 Difference]: With dead ends: 1209 [2025-03-08 06:35:36,568 INFO L226 Difference]: Without dead ends: 781 [2025-03-08 06:35:36,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:36,572 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 398 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:36,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1402 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 100 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2025-03-08 06:35:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-08 06:35:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 765. [2025-03-08 06:35:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 472 states have (on average 1.5127118644067796) internal successors, (714), 483 states have internal predecessors, (714), 253 states have call successors, (253), 35 states have call predecessors, (253), 39 states have return successors, (279), 254 states have call predecessors, (279), 253 states have call successors, (279) [2025-03-08 06:35:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1246 transitions. [2025-03-08 06:35:36,640 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1246 transitions. Word has length 196 [2025-03-08 06:35:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1246 transitions. [2025-03-08 06:35:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 06:35:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1246 transitions. [2025-03-08 06:35:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 06:35:36,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:36,647 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 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] [2025-03-08 06:35:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:35:36,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2138137900, now seen corresponding path program 1 times [2025-03-08 06:35:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507056495] [2025-03-08 06:35:36,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:36,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 06:35:36,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 06:35:36,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-08 06:35:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507056495] [2025-03-08 06:35:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507056495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:35:37,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:35:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:35:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621287905] [2025-03-08 06:35:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:35:37,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:35:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:37,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:35:37,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:35:37,219 INFO L87 Difference]: Start difference. First operand 765 states and 1246 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 06:35:41,232 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:45,407 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:35:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:45,598 INFO L93 Difference]: Finished difference Result 1212 states and 1942 transitions. [2025-03-08 06:35:45,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:35:45,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 196 [2025-03-08 06:35:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:45,603 INFO L225 Difference]: With dead ends: 1212 [2025-03-08 06:35:45,604 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 06:35:45,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:35:45,606 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 389 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:45,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1477 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-03-08 06:35:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 06:35:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 675. [2025-03-08 06:35:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 421 states have (on average 1.479809976247031) internal successors, (623), 430 states have internal predecessors, (623), 214 states have call successors, (214), 35 states have call predecessors, (214), 39 states have return successors, (238), 215 states have call predecessors, (238), 214 states have call successors, (238) [2025-03-08 06:35:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1075 transitions. [2025-03-08 06:35:45,643 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1075 transitions. Word has length 196 [2025-03-08 06:35:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:45,644 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1075 transitions. [2025-03-08 06:35:45,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-08 06:35:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1075 transitions. [2025-03-08 06:35:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 06:35:45,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:45,648 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 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] [2025-03-08 06:35:45,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:35:45,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:45,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash 639366261, now seen corresponding path program 1 times [2025-03-08 06:35:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090053557] [2025-03-08 06:35:45,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:45,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 06:35:45,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 06:35:45,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:45,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-08 06:35:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090053557] [2025-03-08 06:35:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090053557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835227862] [2025-03-08 06:35:46,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:46,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:46,087 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:35:46,088 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:35:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 06:35:46,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 06:35:46,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:46,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:46,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 06:35:46,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-03-08 06:35:46,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:35:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-08 06:35:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835227862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:35:47,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:35:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-08 06:35:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64975854] [2025-03-08 06:35:47,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:35:47,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:35:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:35:47,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:35:47,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:35:47,027 INFO L87 Difference]: Start difference. First operand 675 states and 1075 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-03-08 06:35:51,041 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:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:35:52,389 INFO L93 Difference]: Finished difference Result 1705 states and 2735 transitions. [2025-03-08 06:35:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:35:52,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 200 [2025-03-08 06:35:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:35:52,397 INFO L225 Difference]: With dead ends: 1705 [2025-03-08 06:35:52,397 INFO L226 Difference]: Without dead ends: 1057 [2025-03-08 06:35:52,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 399 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:35:52,402 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1103 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 699 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:35:52,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1311 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 1098 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 06:35:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-03-08 06:35:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1036. [2025-03-08 06:35:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 639 states have (on average 1.4788732394366197) internal successors, (945), 654 states have internal predecessors, (945), 335 states have call successors, (335), 57 states have call predecessors, (335), 61 states have return successors, (373), 334 states have call predecessors, (373), 335 states have call successors, (373) [2025-03-08 06:35:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1653 transitions. [2025-03-08 06:35:52,487 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1653 transitions. Word has length 200 [2025-03-08 06:35:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:35:52,489 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1653 transitions. [2025-03-08 06:35:52,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-03-08 06:35:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1653 transitions. [2025-03-08 06:35:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 06:35:52,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:35:52,495 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 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] [2025-03-08 06:35:52,506 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:35:52,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:52,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:35:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:35:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1631864651, now seen corresponding path program 1 times [2025-03-08 06:35:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:35:52,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944886067] [2025-03-08 06:35:52,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:35:52,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 06:35:52,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 06:35:52,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:52,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-08 06:35:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:35:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944886067] [2025-03-08 06:35:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944886067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:35:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43992245] [2025-03-08 06:35:54,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:35:54,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:35:54,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:35:54,217 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:35:54,218 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:35:54,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 06:35:54,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 06:35:54,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:35:54,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:35:54,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1771 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 06:35:54,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:35:54,925 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:36:07,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 06:36:07,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 06:36:07,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-03-08 06:36:09,447 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-03-08 06:36:09,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-03-08 06:36:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-03-08 06:36:32,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:36:32,283 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:36:32,289 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:36:38,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43992245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:36:38,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 06:36:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2025-03-08 06:36:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627113325] [2025-03-08 06:36:38,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 06:36:38,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 06:36:38,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:36:38,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 06:36:38,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1125, Unknown=5, NotChecked=0, Total=1260 [2025-03-08 06:36:38,738 INFO L87 Difference]: Start difference. First operand 1036 states and 1653 transitions. Second operand has 31 states, 29 states have (on average 4.068965517241379) internal successors, (118), 29 states have internal predecessors, (118), 16 states have call successors, (50), 10 states have call predecessors, (50), 12 states have return successors, (50), 14 states have call predecessors, (50), 16 states have call successors, (50)